A linear bound towards the traceability conjecture

zbMath1326.05058MaRDI QIDQ895060

Marietjie Frick, Susan A. van Aardt, Nicolas Lichiardopol, Jean E. Dunbar

Publication date: 26 November 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i4p26

zbMATH Keywords

oriented graph\(k\)-traceablepath partition conjecturetraceability conjecturegeneralized tournament

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Forbidden subdigraphs conditions on the traceability conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Computational results on the traceability of oriented graphs of small order
• Cycles in \(k\)-traceable oriented graphs
• Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
• Traceability of \(k\)-traceable oriented graphs
• A traceability conjecture for oriented graphs
• Stable set meeting every longest path
• Every finite strongly connected digraph of stability 2 has a Hamiltonian path
• An iterative approach to the traceability conjecture for oriented graphs
• The order of hypotraceable oriented graphs
• Longest path partitions in generalizations of tournaments
• The directed path partition conjecture
• Digraphs

This page was built for publication: A linear bound towards the traceability conjecture