Hamilton cycle decomposition of 6-regular circulants of odd order
From MaRDI portal
Publication:3427363
DOI10.1002/jcd.20118zbMath1113.05081MaRDI QIDQ3427363
Publication date: 20 March 2007
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.20118
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
On Hamilton decompositions of infinite circulant graphs, Vertex‐Transitive Graphs of Prime‐Squared Order Are Hamilton‐Decomposable, On isomorphic factorizations of circulant graphs, Hamiltonian decompositions of 4‐regular Cayley graphs of infinite abelian groups, Hamilton decompositions of 6-regular Cayley graphs on even abelian groups with involution-free connections sets, Hamilton decompositions of certain 6-regular Cayley graphs on abelian groups with a cyclic subgroup of index two, 6-regular Cayley graphs on abelian groups of odd order are Hamiltonian decomposable, An asymptotic solution to the cycle decomposition problem for complete graphs, Vertex-transitive graphs that have no Hamilton decomposition