On Hamilton cycle decomposition of 6-regular circulant graphs
DOI10.1007/S00373-006-0657-0zbMATH Open1108.05057OpenAlexW2003567067MaRDI QIDQ855297FDOQ855297
Authors: Matthew Dean 
Publication date: 5 January 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-006-0657-0
Recommendations
- Hamilton cycle decomposition of 6-regular circulants of odd order
- scientific article; zbMATH DE number 434920
- Hamiltonian decomposition of recursive circulant graphs
- Hamiltonicity properties of circulant digraphs of semiprime or power of prime order
- Some results on decompositions of low degree circulant graphs
Eulerian and Hamiltonian graphs (05C45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Hamiltonian decomposition of Cayley graphs of degree 4
- Hamiltonian decompositions of Cayley graphs on Abelian groups
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey
- Hamiltonian decompositions of Cayley graphs on abelian groups of even order
- Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups
Cited In (16)
- Hamilton decompositions of 6-regular Cayley graphs on even abelian groups with involution-free connections sets
- A family of efficient six-regular circulants representable as a Kronecker product
- Hamilton decompositions of certain 6-regular Cayley graphs on abelian groups with a cyclic subgroup of index two
- Bipartite 2‐Factorizations of Complete Multipartite Graphs
- \(n\)-isofactorizations of 8-regular circulant graphs
- Some results on decompositions of low degree circulant graphs
- Vertex-transitive graphs that have no Hamilton decomposition
- Hamilton paths and cycles in vertex-transitive graphs of order \(6p\)
- Hamiltonian decomposition of recursive circulant graphs
- On Hamilton decompositions of infinite circulant graphs
- Title not available (Why is that?)
- On the Hamilton‐Waterloo Problem for Bipartite 2‐Factors
- Hamilton cycle decomposition of 6-regular circulants of odd order
- On uniqueness of packing of three copies of 2-factors
- On bipartite 2-factorizations of kn − I and the Oberwolfach problem
- Title not available (Why is that?)
This page was built for publication: On Hamilton cycle decomposition of 6-regular circulant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855297)
