Triangle-free oriented graphs and the traceability conjecture
From MaRDI portal
Publication:898141
DOI10.1016/J.DISC.2015.10.022zbMATH Open1327.05138OpenAlexW2108957382WikidataQ123149706 ScholiaQ123149706MaRDI QIDQ898141FDOQ898141
Authors: 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
Recommendations
Cites Work
Cited In (8)
- A traceability conjecture for oriented graphs
- Antiparallel \(d\)-stable traces and a stronger version of ore problem
- Progress on the traceability conjecture for oriented graphs
- An iterative approach to the traceability conjecture for oriented graphs
- Title not available (Why is that?)
- Forbidden subdigraphs conditions on the traceability conjecture
- A linear bound towards the traceability conjecture
- On \(k\)-anti-traceability of oriented graphs
This page was built for publication: Triangle-free oriented graphs and the traceability conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898141)