Edge-Hamiltonian property in regular 2-connected graphs (Q914700)

\textit{B. Jackson} [J. Comb. Theory, Ser. B 29, 27-46 (1980; Zbl 0432.05037)] proved that every 2-connected, k-regular graph with at most 3k vertices is Hamiltonian. The author extends this to the following. Let G be a 2-connected, k-regular graph on n vertices and suppose uv is any edge of G for which \(\{\) u,v\(\}\) is not a cut-set. Then G has a Hamiltonian cycle containing uv if \(n\leq 3k-1\) or if \(n=3k\) and G does not belong to a prescribed class of graphs. The proof is given only for the case \(n\leq 3k-1\); the remainder is said to be available in the Master's thesis of the author.