Triangle-free oriented graphs and the traceability conjecture

DOI10.1016/J.DISC.2015.10.022zbMath1327.05138OpenAlexW2108957382WikidataQ123149706 ScholiaQ123149706MaRDI QIDQ898141

Nicolas Lichiardopol

Publication date: 8 December 2015

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

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

zbMATH Keywords

girthoriented graph\(k\)-traceabletraceability conjecturetraceable oriented graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Forbidden subdigraphs conditions on the traceability conjecture

Cites Work

• Unnamed Item
• Traceability of \(k\)-traceable oriented graphs
• A traceability conjecture for oriented graphs
• An iterative approach to the traceability conjecture for oriented graphs
• Digraphs

This page was built for publication: Triangle-free oriented graphs and the traceability conjecture