Abstract

We show that 3-connected cubic bipartite planar graphs with fewer than 66 vertices are Hamiltonian.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title
Journal
Date
Author
4-connected projective-planar graphs are hamiltonian-connected
Ken-Ichi Kawarabayashi ... Kenta Ozeki
-
Ken-Ichi Kawarabayashi, et. al.Ken-Ichi Kawarabayashi ... Kenta Ozeki
06 Jan 2013
4-connected projective-planar graphs are hamiltonian-connected
...
-
, et. al. ...
06 Jan 2013
3-Connected planar graphs are 5-distinguishing colorable with two exceptions
Gašper Fijavž ... Terukazu Sano
Ars Mathematica Contemporanea | VOL. 4
Gašper Fijavž, et. al.Gašper Fijavž ... Terukazu Sano
19 Mar 2011
SIGEST
The Editors
SIAM Review | VOL. 64
The Editors The Editors
01 May 2022
View more papers

More From: Journal of Combinatorial Theory, Series B

Paper Title
Journal
Date
Author
Random homomorphisms into the orthogonality graph
Dávid Kunszenti-Kovács ... Balázs Szegedy
Journal of Combinatorial Theory, Series B | VOL. 167
Dávid Kunszenti-Kovács, et. al.Dávid Kunszenti-Kovács ... Balázs Szegedy
17 Apr 2024
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure
Kenny Štorgel ... Martin Milanič
Journal of Combinatorial Theory, Series B | VOL. 167
Kenny Štorgel, et. al.Kenny Štorgel ... Martin Milanič
10 Apr 2024
Cancellative hypergraphs and Steiner triple systems
Xizhi Liu
Journal of Combinatorial Theory, Series B | VOL. 167
Xizhi LiuXizhi Liu
03 Apr 2024
Typical structure of hereditary properties of binary matroids
Stefan Grosser ... Sergey Norin
Journal of Combinatorial Theory, Series B | VOL. 167
Stefan Grosser, et. al.Stefan Grosser ... Sergey Norin
28 Mar 2024
View more papers