On the Prevalence of Bridge Graphs Among Non-3-Connected Cubic Non-Hamiltonian Graphs

08/28/2019

∙

by   Rishi Advani, et al.

∙

0

∙

share

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.