Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
On Sheehan’s Conjecture for graphs with symmetry It is known that every simple regular graph of degree d that has a Hamilton cycle in fact possesses a second Hamilton cycle if d is odd or d≥ 300. Sheehan conjectured that the statement is also true for d= 4, which would imply that it is true for every d> 2. Fleischner showed that Sheehan’s conjecture fails for 4-regular multigraphs. In this talk, we show that Sheehan’s