Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs

DOI10.1007/BF01839493zbMath0679.05049MaRDI QIDQ1124606

Moshe Rosenfeld

Publication date: 1989

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

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

zbMATH Keywords

planar graphsHamiltonian circuitHamiltonian circuitscyclically 5- connected planar graph

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

Hamiltonian cycles and 1-factors in 5-regular graphs ⋮ On the Circumference of Essentially 4-connected Planar Graphs

Cites Work

• Unnamed Item
• Non-Hamiltonian cubic planar maps
• 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
• Hamiltonian circuits in certain prisms
• A Theorem on Planar Graphs
• Cyclability of r-regular r-connected graphs
• Polytopes, graphs, and complexes

This page was built for publication: Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs