  There is empirical evidence supporting the claim that almost all cubic
non-Hamiltonian graphs are bridge graphs. In this paper, we pose a related
conjecture and prove that the original claim holds for non-3-connected graphs
if the conjecture is true.
