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

08/28/2019
by   Rishi Advani, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/04/2021

The Minimality of the Georges-Kelmans Graph

In 1971, Tutte wrote in an article that "it is tempting to conjecture th...
research
06/06/2022

On Hamiltonian-Connected and Mycielski graphs

A graph G is Hamiltonian-connected if there exists a Hamiltonian path be...
research
09/02/2023

An Elementary Construction of Modified Hamiltonians and Modified Measures of 2D Kahan Maps

We show how to construct in an elementary way the invariant of the KHK d...
research
12/14/2017

Structural and computational results on platypus graphs

A platypus graph is a non-hamiltonian graph for which every vertex-delet...
research
02/23/2022

Matching Theory and Barnette's Conjecture

Barnette's Conjecture claims that all cubic, 3-connected, planar, bipart...
research
12/13/2018

Graphs with few Hamiltonian Cycles

We describe an algorithm for the exhaustive generation of non-isomorphic...
research
08/25/2017

Hamiltonian Maker-Breaker games on small graphs

We look at the unbiased Maker-Breaker Hamiltonicity game played on the e...

Please sign up or login with your details

Forgot password? Click here to reset