✦ LIBER ✦

The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices

✍ Scribed by D.A Holton; B.D McKay

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A cubic 3-connected graph having no cycl

✍ A. K. Kelmans; M. V. Lomonosov 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 55 KB

## Abstract It has been proved [1,2] that in a cubic 3‐connected graph any 9 vertices lie on a common cycle.