k-ordered Hamiltonian graphs
From MaRDI portal
Publication:5284595
DOI<45::AID-JGT6>3.0.CO;2-J 10.1002/(SICI)1097-0118(199701)24:1<45::AID-JGT6>3.0.CO;2-JzbMath0864.05062MaRDI QIDQ5284595
Michelle Schultz, Lenhard L. Ng
Publication date: 16 June 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199701)24:1<45::aid-jgt6>3.0.co;2-j
05C45: Eulerian and Hamiltonian graphs
Related Items
Hamiltonian Extension, Cyclability, connectivity and circumference, 2-Trees: Structural insights and the study of Hamiltonian paths, Solution to an open problem on 4-ordered Hamiltonian graphs, On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem, Generalizing vertex pancyclic and \(k\)-ordered graphs, On 4-ordered 3-regular graphs, 4-connected triangulations and 4-orderedness, Set-orderedness as a generalization of \(k\)-orderedness and cyclability, Subdivision extendibility, Graph powers and \(k\)-ordered hamiltonicity, 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\)-edge-ordered graphs, On \(k\)-ordered graphs involved degree sum, 2-spanning cyclability problems of some generalized Petersen graphs, On cycles that alternate through selected sets of vertices, 7-connected graphs are 4-ordered, Degree sum condition for \(k\)-ordered Hamiltonian connected graphs, On low degree \(k\)-ordered graphs, Recent advances on the Hamiltonian problem: survey III, Long cycles containing \(k\)-ordered vertices in graphs, On 3-regular 4-ordered graphs, Feedback vertex set on Hamiltonian graphs, A study on thek-ordered hamiltonian graphs
