On $k$-ordered Hamiltonian Graphs

Gabor N. Sarkozy, Stanley Selkow

A Hamiltonian graph $G$ of order $n$ is $k$-ordered, $2\le k\le n$, if for every sequence $v_1,v_2,\dots ,v_k$ of $k$ distinct vertices of $G$, there exists a Hamiltonian cyc…