On low degree \(k\)-ordered graphs

DOI10.1016/j.disc.2007.05.024zbMath1171.05043arXivmath/0509411OpenAlexW2032918355MaRDI QIDQ2427501

Karola Mészáros

Publication date: 13 May 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0509411

zbMATH Keywords

\(k\)-ordered hamiltonicity\(k\)-orderedness

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• A sufficient condition for graphs to be weakly \(k\)-linked
• An improved linear edge bound for graph linkages
• On \(k\)-edge-ordered graphs
• On \(k\)-ordered bipartite graphs
• On 3-regular 4-ordered graphs
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Onk-ordered Hamiltonian graphs
• Onk-ordered graphs
• Degree conditions for k‐ordered hamiltonian graphs
• k-ordered Hamiltonian graphs
• Survey of results on \(k\)-ordered graphs

This page was built for publication: On low degree \(k\)-ordered graphs