Decomposing graphs into paths of fixed length |
| |
Authors: | Carsten Thomassen |
| |
Institution: | 1. Department of Mathematics, Technical University of Denmark, DK-2800, Lyngby, Denmark 2. King Abdulaziz University, Jeddah, Saudi-Arabia
|
| |
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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|