Add Holton-McKay (1988) reference paper to research/

Browse Source

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>

...

This commit is contained in:

didericis

2026-05-22 11:47:57 -04:00

parent 5675207ae0

commit 9995972336

1 changed files with 0 additions and 0 deletions

Show all changes Ignore whitespace when comparing lines Ignore changes in amount of whitespace Ignore changes in whitespace at EOL

Download Patch File Download Diff File Expand all files Collapse all files

research/The Smallest non-Hamiltonian 3-connected cubic planar graphs have 38 vertices.pdf

BIN

Binary file not shown.