k-ordered Hamiltonian graphs
From MaRDI portal
Publication:5284595
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199701)24:1<45::AID-JGT6>3.0.CO;2-J" /><45::AID-JGT6>3.0.CO;2-J 10.1002/(SICI)1097-0118(199701)24:1<45::AID-JGT6>3.0.CO;2-JzbMath0864.05062OpenAlexW4245518162MaRDI 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
Related Items (28)
On \(k\)-ordered graphs involved degree sum ⋮ 2-spanning cyclability problems of some generalized Petersen graphs ⋮ Subdivision extendibility ⋮ Feedback vertex set on Hamiltonian graphs ⋮ Cyclability, connectivity and circumference ⋮ 2-Trees: Structural insights and the study of Hamiltonian paths ⋮ On low degree \(k\)-ordered graphs ⋮ A study on thek-ordered hamiltonian graphs ⋮ Solution to an open problem on 4-ordered Hamiltonian graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem ⋮ On 4-ordered 3-regular graphs ⋮ Graph powers and \(k\)-ordered hamiltonicity ⋮ On cycles that alternate through selected sets of vertices ⋮ Generalizing vertex pancyclic and \(k\)-ordered graphs ⋮ Minimum degree conditions for \(H\)-linked graphs ⋮ \(k\)-Ordered Hamilton cycles in digraphs ⋮ Long cycles containing \(k\)-ordered vertices in graphs ⋮ On 3-regular 4-ordered graphs ⋮ Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian ⋮ 4-connected triangulations and 4-orderedness ⋮ Set-orderedness as a generalization of \(k\)-orderedness and cyclability ⋮ 7-connected graphs are 4-ordered ⋮ \(k\)-ordered hamiltonicity of iterated line graphs ⋮ On \(k\)-edge-ordered graphs ⋮ A look at cycles containing specified elements of a graph ⋮ Hamiltonian Extension ⋮ Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
This page was built for publication: k-ordered Hamiltonian graphs
