In 1975, Sheehan conjectured that every simple 4-regular hamiltonian graph has a second Hamilton cycle. If Sheehan’s Conjecture holds, then the result can be extended to all simple d-regular hamiltonian graphs with d ≥ 3. First, we survey some previous results which verify the existence of a second Hamilton cycle if d is large enough. We will then demonstrate some techniques for finding a second Hamilton cycle that will be used throughout this paper. Finally, we use these techniques and show that for certain 4-regular Hamiltonian graphs whose automorphism group is large enough, a second Hamilton cycle exists. ii Acknowledgements I would sincerely like to thank my supervisor, Mateja Šajna, for her tireless patience and support throughout th...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
In 1999, Jacobson and Lehel conjectured that, for k >= 3, every k-regular Hamiltonian graph has cycl...
We prove that there exists an infinite family of 4-regular 4-connected Hamiltonian graphs with a bou...
In 1975, Sheehan conjectured that every simple 4-regular hamiltonian graph has a second Hamilton cyc...
AbstractIn 1975, John Sheehan conjectured that every Hamiltonian 4-regular graph has a second Hamilt...
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four...
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four...
It has been shown by Carsten Thomassen that when r is suciently large, Lovasz Local Lemma can be ap...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
Abstract. We prove that, for large n, every 3-connected D-regular graph on n vertices with D ≥ n/4 i...
AbstractWe describe a general sufficient condition for a Hamiltonian graph to contain another Hamilt...
Coxeter referred to generalizing the Petersen graph. Zhou and Feng modified the graphs and introduce...
AbstractA graph G is k-ordered if for any sequence of k distinct vertices of G, there exists a cycle...
We prove that, for large n, every 3-connected D-regular graph on n vertices with is Hamiltonian. Th...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
In 1999, Jacobson and Lehel conjectured that, for k >= 3, every k-regular Hamiltonian graph has cycl...
We prove that there exists an infinite family of 4-regular 4-connected Hamiltonian graphs with a bou...
In 1975, Sheehan conjectured that every simple 4-regular hamiltonian graph has a second Hamilton cyc...
AbstractIn 1975, John Sheehan conjectured that every Hamiltonian 4-regular graph has a second Hamilt...
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four...
Sheehan conjectured in 1975 that every Hamiltonian regular simple graph of even degree at least four...
It has been shown by Carsten Thomassen that when r is suciently large, Lovasz Local Lemma can be ap...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
Abstract. We prove that, for large n, every 3-connected D-regular graph on n vertices with D ≥ n/4 i...
AbstractWe describe a general sufficient condition for a Hamiltonian graph to contain another Hamilt...
Coxeter referred to generalizing the Petersen graph. Zhou and Feng modified the graphs and introduce...
AbstractA graph G is k-ordered if for any sequence of k distinct vertices of G, there exists a cycle...
We prove that, for large n, every 3-connected D-regular graph on n vertices with is Hamiltonian. Th...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constan...
In 1999, Jacobson and Lehel conjectured that, for k >= 3, every k-regular Hamiltonian graph has cycl...
We prove that there exists an infinite family of 4-regular 4-connected Hamiltonian graphs with a bou...