On the Prevalence of Bridge Graphs Among Non-3-Connected Cubic Non-Hamiltonian Graphs
Combinatorics
2019-08-29 v1 Discrete Mathematics
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.
Cite
@article{arxiv.1908.10528,
title = {On the Prevalence of Bridge Graphs Among Non-3-Connected Cubic Non-Hamiltonian Graphs},
author = {Rishi Advani},
journal= {arXiv preprint arXiv:1908.10528},
year = {2019}
}