Hamiltonian cycles in cubic 3-connected bipartite planar graphs

DOI10.1016/0095-8956(85)90072-3zbMath0551.05052OpenAlexW1967318939MaRDI QIDQ801087

Derek Holton, Bennet Manvel, Brendan D. McKay

Publication date: 1985

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(85)90072-3

zbMATH Keywords

planar graphsbipartite graphscubic graphshamiltonian cycles

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (18)

On Barnette's conjecture and the \(H^{+-}\) property ⋮ On Finding Hamiltonian Cycles in Barnette Graphs ⋮ Inductive classes of bipartite cubic graphs ⋮ Cuts in matchings of 3-connected cubic graphs ⋮ The minimality of the Georges–Kelmans graph ⋮ Construction of Barnette graphs whose large subgraphs are non-Hamiltonian ⋮ Hamiltonian cycles in planar cubic graphs with facial 2‐factors, and a new partial solution of Barnette's Conjecture ⋮ On some conjectures on cubic 3-connected graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ Generating 4-connected even triangulations on the sphere ⋮ Planar Eulerian triangulations are equivalent to spherical Latin bitrades ⋮ Extension of a theorem of Whitney ⋮ Latin bitrades, dissections of equilateral triangles, and abelian groups ⋮ On Barnette's conjecture ⋮ Multiple Hamilton cycles in bipartite cubic graphs: an algebraic method ⋮ Remarks on Barnette's conjecture ⋮ A note on the smallest connected non-traceable cubic bipartite planar graph ⋮ Matching theory and Barnette's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-Hamiltonian 3-connected cubic bipartite graphs
• Random triangulations of the plane
• Hamiltonian circuits on simple 3-polytopes with up to 30 vertices
• A nine point theorem for 3-connected graphs
• Hamiltonian circuits in simple 3-polytopes with up to 26 vertices
• Hamiltonian circuits in polytopes with even sided faces
• Hamiltonian circuits on simple 3-polytopes
• A Theorem on Planar Graphs
• Every simple 3-polytope of order 32 or less is Hamiltonian
• Hamiltonian Circuits on Simple 3-Polytopes
• A Census of Planar Maps
• On Hamiltonian Circuits
• A theorem on paths in planar graphs

This page was built for publication: Hamiltonian cycles in cubic 3-connected bipartite planar graphs