The smallest non-Hamiltonian 3-connected cubic planar graphs have 38
vertices (J. Combin. Theory Ser. B 45:305-319). Reference for the
even_level_graph_generators conjecture: via the intertwining-tree =
Hamiltonian-dual equivalence, the duals of the non-Hamiltonian C3CPs
classified here are exactly the triangulations the conjecture must
reach through the bridge-derived-level-graph disjunct.
Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
didericis
9995972336