On the longest path in a recursively partitionable graph
A connected graph \(G\) with order \(n \geq 1\) is said to be recursively arbitrarily partitionable (R-AP for short) if either it is isomorphic to \(K_1\), or for every sequence \((n_1, \ldots , n_p)\) of positive integers summing up to \(n\) there exists a partition \((V_1, \ldots , V_p)\) of \(V(G...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2013-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol33/4/art/opuscula_math_3334.pdf |