3 research outputs found
Decomposing 8-regular graphs into paths of length 4
A -decomposition of a graph is a set of edge-disjoint copies of in
that cover the edge set of . Graham and H\"aggkvist (1989) conjectured
that any -regular graph admits a -decomposition if is a tree
with edges. Kouider and Lonc (1999) conjectured that, in the special
case where is the path with edges, admits a -decomposition
where every vertex of is the end-vertex of exactly two paths
of , and proved that this statement holds when has girth at
least . In this paper we verify Kouider and Lonc's Conjecture for
paths of length