The smallest 2-connected cubic bipartite planar nonhamiltonian graph

DOI10.1016/0012-365X(82)90162-5zbMath0473.05042OpenAlexW2054595744MaRDI QIDQ1158439

Frank Harary, Nobuji Saito, Takao Asano, Geoffrey Exoo

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90162-5

zbMATH Keywords

2-connected nonhamiltonian graph

Mathematics Subject Classification ID

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

Related Items (5)

The cost of perfection for matchings in graphs ⋮ The complexity of recognizing tough cubic graphs ⋮ A note on the smallest connected non-traceable cubic bipartite planar graph ⋮ On the minimum leaf number of cubic graphs ⋮ Matching theory and Barnette's conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• A Theorem on Planar Graphs
• On Hamiltonian Circuits

This page was built for publication: The smallest 2-connected cubic bipartite planar nonhamiltonian graph