Graphs that admit square 1-factorizations are hamiltonian Cayley graphs

DOI10.1007/BF01787812zbMath0855.05087OpenAlexW1993309610WikidataQ114233926 ScholiaQ114233926MaRDI QIDQ1906856

Edwin C. Ihrig

Publication date: 13 February 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787812

zbMATH Keywords

Cayley graph1-factorizationvertex transitivityhamiltonicity

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Free nilpotent and \(H\)-type Lie algebras. Combinatorial and orthogonal designs

Cites Work

• Unnamed Item
• On hamiltonian circuits in Cayley diagrams
• An explicit 1-factorization in the middle of the Boolean lattice
• On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs
• The Binary Alloy Problem: Existence, Uniqueness, and Numerical Approximations
• Hamiltonian Cubic Graphs and Centralizers of Involutions
• Hamiltonian cycles in cayley color graphs
• A survey: Hamiltonian cycles in Cayley graphs

This page was built for publication: Graphs that admit square 1-factorizations are hamiltonian Cayley graphs