\(k\)-Ordered Hamilton cycles in digraphs
From MaRDI portal
Publication:958680
DOI10.1016/j.jctb.2008.01.002zbMath1176.05042arXiv0707.1577MaRDI QIDQ958680
Publication date: 8 December 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0707.1577
05C38: Paths and cycles
05C20: Directed graphs (digraphs), tournaments
05C45: Eulerian and Hamiltonian graphs
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(k\)-linked and \(k\)-cyclic digraphs
- Hamiltonian paths in oriented graphs
- Advances on the Hamiltonian problem -- a survey
- On Sufficient Degree Conditions for a Graph to be $k$-linked
- Linkedness and Ordered Cycles in Digraphs
- Linear forests and ordered cycles
- Degree conditions for k‐ordered hamiltonian graphs