Onk-ordered Hamiltonian graphs
From MaRDI portal
Publication:4265584
DOI<17::AID-JGT2>3.0.CO;2-G 10.1002/(SICI)1097-0118(199909)32:1<17::AID-JGT2>3.0.CO;2-GzbMath0929.05055MaRDI QIDQ4265584
Gábor N. Sárközy, Stanley M. Selkow, Henry A. Kierstead
Publication date: 23 November 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199909)32:1<17::aid-jgt2>3.0.co;2-g
05C45: Eulerian and Hamiltonian graphs
Related Items
Degree Conditions for H-Linked Digraphs, Hamiltonian Extension, 2-Trees: Structural insights and the study of Hamiltonian paths, Locating sets of vertices on Hamiltonian cycles, A survey on Hamilton cycles in directed graphs, Set-orderedness as a generalization of \(k\)-orderedness and cyclability, An improved degree based condition for Hamiltonian cycles, Minimum degree conditions for \(H\)-linked graphs, \(k\)-Ordered Hamilton cycles in digraphs, Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian, \(k\)-ordered hamiltonicity of iterated line graphs, A look at cycles containing specified elements of a graph, On \(k\)-ordered graphs involved degree sum, On low degree \(k\)-ordered graphs, Recent advances on the Hamiltonian problem: survey III, Long cycles containing \(k\)-ordered vertices in graphs, New Ore-Type Conditions for H-Linked Graphs, A minimum degree condition forcing a digraph to be k-linked, A study on thek-ordered hamiltonian graphs
Cites Work
