par Filar, Jerzy J.A.;Haythorpe, Michael;Nguyen, Giang 
Référence Discussiones Mathematicae. Graph Theory, 30, 1, page (175-179)
Publication Publié, 2010
Référence Discussiones Mathematicae. Graph Theory, 30, 1, page (175-179)
Publication Publié, 2010
Article révisé par les pairs
| Résumé : | Almost all d-regular graphs are Hamiltonian, for d ≥ 3 [8]. 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. |
