Some basic properties of multiple Hamiltonian covers

DOI10.1016/j.dam.2006.03.035zbMath1096.05032OpenAlexW2010817732MaRDI QIDQ2500529

Hans L. Fetter

Publication date: 17 August 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2006.03.035

zbMATH Keywords

coversHamiltonian cyclesmatchingscubic graphsdihedral angle-sum

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Edge-disjoint Hamilton cycles in 4-regular planar graphs
• Extending an extension of Grinberg's theorem
• Pairs of edge-disjoint Hamiltonian circuits
• The sum of the solid angles of a \(d\)-polytope
• A necessary condition for the existence of a circuit of any specified length
• Construction of third-order Hamiltonian graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item