Traceability of \(k\)-traceable oriented graphs

DOI10.1016/j.disc.2009.12.022zbMath1195.05030OpenAlexW2046267970MaRDI QIDQ965994

B. E. Eshmatov

Publication date: 27 April 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2009.12.022

zbMATH Keywords

oriented graphlongest pathtraceable\(k\)-traceablehypotraceabletraceability conjecturegeneralized tournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Every 8-traceable oriented graph is traceable ⋮ Computational results on the traceability of oriented graphs of small order ⋮ Forbidden subdigraphs conditions on the traceability conjecture ⋮ A linear bound towards the traceability conjecture ⋮ Triangle-free oriented graphs and the traceability conjecture ⋮ Cycles in \(k\)-traceable oriented graphs ⋮ The order of hypotraceable oriented graphs ⋮ Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A traceability conjecture for oriented graphs
• Stable set meeting every longest path
• Every finite strongly connected digraph of stability 2 has a Hamiltonian path
• Independent sets which meet all longest paths
• Independent sets and non-augmentable paths in generalizations of tournaments
• Longest path partitions in generalizations of tournaments
• Hypotraceable digraphs
• The directed path partition conjecture

This page was built for publication: Traceability of \(k\)-traceable oriented graphs