Onk-ordered graphs
From MaRDI portal
Publication:4518332
Recommendations
Cites work
Cited in
(26)- k-ordered hamiltonicity of iterated line graphs
- A look at cycles containing specified elements of a graph
- Ordered \(h\)-level graphs on the BSP model
- On \(k\)-edge-ordered graphs
- On \(k\)-ordered bipartite graphs
- On \(k\)-ordered graphs involved degree sum
- 7-connected graphs are 4-ordered
- On low degree \(k\)-ordered graphs
- Recent advances on the Hamiltonian problem: survey III
- Long cycles containing k-ordered vertices in graphs
- k-ordered graphs \& out-arc pancyclicity on digraphs
- New Ore-type conditions for H-linked graphs
- A study on thek-ordered hamiltonian graphs
- Ordered and linked chordal graphs
- Ordered set in the 3-connected and 3-regular graphs
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
- scientific article; zbMATH DE number 3997833 (Why is no real title available?)
- Long paths containing \(k\)-ordered vertices in graphs
- Survey of results on \(k\)-ordered graphs
- Forbidden subgraphs that imply k-ordered and k-ordered Hamiltonian
- 2-Trees: Structural insights and the study of Hamiltonian paths
- On 4-ordered 3-regular graphs
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability
- Subdivision extendibility
- Minimum degree conditions for H-linked graphs
- Degree conditions on distance 2 vertices that imply \(k\)-ordered Hamiltonian
This page was built for publication: Onk-ordered graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4518332)