Linda Lesniak (Drew University)
For a positive integer k, a graph G is k-ordered hamiltonian if for every ordered sequence of k vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order. Degree conditions for k-ordered hamiltonicity are discussed.
CoNE April, 2000