Every 8-traceable oriented graph is traceable

DOI10.7151/dmgt.1966zbMath1372.05094OpenAlexW2589538997MaRDI QIDQ2409787

Susan A. van Aardt

Publication date: 13 October 2017

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1966

zbMATH Keywords

oriented graphtraceable\(k\)-traceablehypotraceablegeneralized 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
• An iterative approach to the traceability conjecture for oriented graphs
• The order of hypotraceable oriented graphs
• Digraphs

This page was built for publication: Every 8-traceable oriented graph is traceable