On the Prevalence of Bridge Graphs Among Non-3-Connected Cubic Non-Hamiltonian Graphs
From MaRDI portal
Publication:6324307
arXiv1908.10528MaRDI QIDQ6324307
Publication date: 27 August 2019
Abstract: 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.
This page was built for publication: On the Prevalence of Bridge Graphs Among Non-3-Connected Cubic Non-Hamiltonian Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6324307)
