Survey of results on \(k\)-ordered graphs (Q5931446): Difference between revisions

For a positive integer \(k\), a graph \(G\) is \(k\)-ordered if for every ordered set of \(k\) vertices, there is a cycle that encounters the vertices of the set in the given order. If the cycle is also a Hamiltonian cycle, then \(G\) is said to be \(k\)-ordered Hamiltonian. This concept was introduced in 1997 by \textit{L. Ng} and \textit{M. Schultz} [J. Graph Theory 24, No. 1, 45-57 (1997; Zbl 0864.05062)]. There has been a series of results involving degree conditions, neighborhood conditions, and forbidden subgraph conditions that imply \(k\)-ordered or \(k\)-ordered Hamiltonian. Results of this nature are surveyed. In addition, the author presents some interesting open problems.