A note on the smallest connected non-traceable cubic bipartite planar graph

DOI10.1016/j.disc.2019.05.009zbMath1418.05056OpenAlexW2944993723WikidataQ127822933 ScholiaQ127822933MaRDI QIDQ2319723

G. Abrishami, Freydoon Rahbarnia

Publication date: 20 August 2019

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

Full work available at URL: https://doi.org/10.1016/j.disc.2019.05.009

zbMATH Keywords

bipartite graphcubic graphplanar graphHamiltonian path

Mathematics Subject Classification ID

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

Uses Software

• House of Graphs
• plantri

Cites Work

• Unnamed Item
• Unnamed Item
• Hamiltonian cycles in cubic 3-connected bipartite planar graphs
• The smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices
• Non-Hamiltonian bicubic graphs
• The smallest 2-connected cubic bipartite planar nonhamiltonian graph
• House of Graphs: a database of interesting graphs
• Three small cubic graphs with interesting hamiltonian properties
• Fast generation of cubic graphs

This page was built for publication: A note on the smallest connected non-traceable cubic bipartite planar graph