Pairs of Hamiltonian circuits in 5-connected planar graphs

DOI10.1016/0095-8956(76)90051-4zbMath0309.05120OpenAlexW2030734685MaRDI QIDQ1218869

Joseph Zaks

Publication date: 1976

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(76)90051-4

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (6)

Hamiltonian cycles and 1-factors in 5-regular graphs ⋮ On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks ⋮ Shortness parameters of families of regular planar graphs in two or three types of faces ⋮ Surface embedding of \((n,k)\)-extendable graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Regular non-Hamiltonian polyhedral graphs

Cites Work

• Simple paths on convex polyhedra
• The existence of certain planar maps
• Pairs of edge-disjoint Hamiltonian circuits
• On the 1-factors of n-connected graphs
• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• Hamiltonian circuits on simple 3-polytopes
• A Theorem on Planar Graphs
• Über das Problem der Existenz von HAMILTONkreisen in planaren, regulären Graphen
• Polytopes, graphs, and complexes
• Hamiltonian Circuits on Simple 3-Polytopes
• On Hamiltonian Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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