The spectrum problem for closed \(m\)-trails,\(m\leq 10\)

Peter Adams1, Darryn E. Bryant 1, A. Khodkar1
1Centre for Combinatorics Department of Mathematics The University of Queensland Queensland 4072 Australia

Abstract

For every connected, even-degree graph \(G\) with \(10\) or fewer edges, the problem of finding necessary and sufficient conditions for the existence of a decomposition of \(K_v\) into edge-disjoint copies of \(G\) is completely settled.