Edge-disjoint Hamilton cycles in 4-regular planar graphs

DOI10.1007/BF02190157zbMath0464.05037WikidataQ55920248 ScholiaQ55920248MaRDI QIDQ1153926

J. A. Bondy, Roland Haeggkvist

Publication date: 1981

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136851

zbMATH Keywords

Hamiltonian cycles

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Grinberg's criterion ⋮ Balanced generic circuits without long paths ⋮ Sparsity and connectivity of medial graphs: Concerning two edge-disjoint Hamiltonian paths in planar rigidity circuits ⋮ Some basic properties of multiple Hamiltonian covers ⋮ On spanning subgraphs of 4-connected planar graphs ⋮ Regular non-Hamiltonian polyhedral graphs

Cites Work

• The existence of certain planar maps
• Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes
• Pairs of edge-disjoint Hamiltonian circuits
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• A Theorem on Planar Graphs
• From the theory of regular graphs of third and fourth degree

This page was built for publication: Edge-disjoint Hamilton cycles in 4-regular planar graphs