![](/files/happy5.png)
Hamiltonian, Bridge, 3-regular, 1-connected
Almost all non-Hamiltonian 3-regular graphs are 1-connected ★★
Author(s): Haythorpe
Conjecture Denote by
the number of non-Hamiltonian 3-regular graphs of size
, and similarly denote by
the number of non-Hamiltonian 3-regular 1-connected graphs of size
.
![$ NH(n) $](/files/tex/dc7c2bcdf0fdc40cfaa4e4b35d12bfa84042b5f4.png)
![$ 2n $](/files/tex/56259815f2fdf87e92dd22e0058206e8e20fb986.png)
![$ NHB(n) $](/files/tex/f397fa463c02be6928f5ad6655b68aa9a62c7195.png)
![$ 2n $](/files/tex/56259815f2fdf87e92dd22e0058206e8e20fb986.png)
Is it true that ?
![Syndicate content Syndicate content](/misc/feed.png)