Counterexample to a Conjecture on Hamilton Cycles

Abstract

A counterexample is presented to the following conjecture of Jackson: If \(G\) is a 2-connected graph on at most \(3k + 2\) vertices with degree sequence \((k, k, \ldots, k, k+1, k+1)\), then \(G\) is hamiltonian.