Publication | Closed Access
Nonhamiltonian 3-Connected Cubic Planar Graphs
39
Citations
6
References
2000
Year
Geometric Graph TheoryGraph TheoryAlgebraic Graph TheoryTopological Graph TheoryPlanar GraphMost 52Computer-aided DesignDiscrete MathematicsMost 40Extremal Graph TheoryComputational GeometryNonhamiltonian Examples
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp, and we present all nonhamiltonian examples of order 42. In addition we list all nonhamiltonian cyclically 5-connected cubic planar graphs of order at most 52 and all nonhamiltonian 3-connected cubic planar graphs of girth 5 on at most 46 vertices. The fact that all 3-connected cubic planar graphs on at most 176 vertices and with face size at most 6 are hamiltonian is also verified.
| Year | Citations | |
|---|---|---|
Page 1
Page 1