k-ordered Hamiltonian graphs
From MaRDI portal
Publication:5284595
Recommendations
Cited in
(41)- On 3-regular 4-ordered graphs
- Linear forests and ordered cycles
- Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
- Recent advances on the Hamiltonian problem: survey III
- A fan-type result on \(k\)-ordered graphs
- 4-ordered-Hamiltonian problems of the generalized Petersen graph image
- Graph powers and \(k\)-ordered hamiltonicity
- Cyclability, connectivity and circumference
- On cycles that alternate through selected sets of vertices
- Spanning connectedness and Hamiltonian thickness of graphs and interval graphs
- Onk-ordered graphs
- Degree conditions for k‐ordered hamiltonian graphs
- Hamiltonian extension
- \(k\)-Ordered Hamilton cycles in digraphs
- Ordered and ordered Hamilton digraphs
- Minimum degree conditions for \(H\)-linked graphs
- Long paths containing \(k\)-ordered vertices in graphs
- On \(k\)-ordered graphs involved degree sum
- A look at cycles containing specified elements of a graph
- Solution to an open problem on 4-ordered Hamiltonian graphs
- 4-connected triangulations and 4-orderedness
- Long cycles containing \(k\)-ordered vertices in graphs
- 2-spanning cyclability problems of some generalized Petersen graphs
- scientific article; zbMATH DE number 5036076 (Why is no real title available?)
- 7-connected graphs are 4-ordered
- A study on thek-ordered hamiltonian graphs
- Generalizing vertex pancyclic and \(k\)-ordered graphs
- Hamiltonian graphs from Kirkman to König
- \(k\)-ordered hamiltonicity of iterated line graphs
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability
- Feedback vertex set on Hamiltonian graphs
- 2-Trees: Structural insights and the study of Hamiltonian paths
- On 4-ordered 3-regular graphs
- On low degree \(k\)-ordered graphs
- Subdivision extendibility
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
- On \(k\)-edge-ordered graphs
- k-Arc Hamilton graphs
- Forbidden subgraphs that imply \(k\)-ordered and \(k\)-ordered Hamiltonian
- Survey of results on \(k\)-ordered graphs
- Degree sum condition for \(k\)-ordered Hamiltonian connected graphs
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)