Dominating cycles in regular 3-connected graphs (Q1193714): Difference between revisions

The authors conjecture that every 3-connected, \(k\)-regular graph on at most \(4k\) vertices is Hamiltonian for \(k\geq 4\). They prove the weaker statement that every longest cycle is dominating provided \(k\geq 63\).