k-ordered Hamiltonian graphs
From MaRDI portal
Publication:5284595
DOI10.1002/(SICI)1097-0118(199701)24:1%3C45::AID-JGT6%3E3.0.CO;2-JzbMATH Open0864.05062OpenAlexW4245518162MaRDI QIDQ5284595FDOQ5284595
Publication date: 16 June 1997
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199701)24:1%3C45::aid-jgt6%3E3.0.co;2-j
Cited In (35)
- Recent advances on the Hamiltonian problem: survey III
- Minimum degree conditions for \(H\)-linked graphs
- 7-connected graphs are 4-ordered
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability
- \(k\)-Ordered Hamilton cycles in digraphs
- On low degree \(k\)-ordered graphs
- Onk-ordered graphs
- Title not available (Why is that?)
- \(k\)-ordered hamiltonicity of iterated line graphs
- Solution to an open problem on 4-ordered Hamiltonian graphs
- Hamiltonian graphs from Kirkman to König
- A study on thek-ordered hamiltonian graphs
- On \(k\)-ordered graphs involved degree sum
- Forbidden subgraphs that imply \(k\)-ordered and \(k\)-ordered Hamiltonian
- On cycles that alternate through selected sets of vertices
- A look at cycles containing specified elements of a graph
- 4-connected triangulations and 4-orderedness
- On \(k\)-edge-ordered graphs
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
- Survey of results on \(k\)-ordered graphs
- Cyclability, connectivity and circumference
- Long cycles containing \(k\)-ordered vertices in graphs
- Subdivision extendibility
- 2-spanning cyclability problems of some generalized Petersen graphs
- Feedback vertex set on Hamiltonian graphs
- Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
- Hamiltonian Extension
- Generalizing vertex pancyclic and \(k\)-ordered graphs
- On 4-ordered 3-regular graphs
- On 3-regular 4-ordered graphs
- Graph powers and \(k\)-ordered hamiltonicity
- Linear forests and ordered cycles
- Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
- Degree conditions for k‐ordered hamiltonian graphs
- 2-Trees: Structural insights and the study of Hamiltonian paths
Recommendations
This page was built for publication: k-ordered Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284595)