A conjecture on the prevalence of cubic bridge graphs

Almost all d-regular graphs are Hamiltonian, for d ≥ 3. In this note we conjecture that in a similar, yet somewhat different, sense almost all cubic non-Hamiltonian graphs are bridge graphs, and present supporting empirical results for this prevalence of the latter among all connected cubic non-Hamiltonian graphs