Journal article
Decomposing graphs into paths of fixed length
In
Combinatorica
—
2013, Volume 33, Issue 1, pp. 97-123
Abstract
Barát and Thomassen have conjectured that, for any fixed tree T, there exists a natural number k T such that the following holds: If G is a k T -edge-connected graph such that |E(T)| divides |E(G)|, then G has a T-decomposition. The conjecture is trivial when T has one or two edges. Before submission of this paper, the conjecture had been verified only for two other trees: the paths of length 3 and 4, respectively.
In this paper we verify the conjecture for each path whose length is a power of 2.
| Language: | English |
|---|---|
| Publisher: | Springer-Verlag |
| Year: | 2013 |
| Pages: | 97-123 |
| ISSN: | 14396912 and 02099683 |
| Types: | Journal article |
| DOI: | 10.1007/s00493-013-2633-7 |
| ORCIDs: | Thomassen, Carsten |
