A traceability conjecture for oriented graphs
From MaRDI portal
Recommendations
Cited in
(18)- Computational results on the traceability of oriented graphs of small order
- Cycles in \(k\)-traceable oriented graphs
- Hamiltonicity of \(k\)-traceable graphs
- The order of hypotraceable oriented graphs
- Traceability of \(k\)-traceable 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
- scientific article; zbMATH DE number 3972886 (Why is no real title available?)
- Forbidden subdigraphs conditions on the traceability conjecture
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- A linear bound towards the traceability conjecture
- Triangle-free oriented graphs and the traceability conjecture
- scientific article; zbMATH DE number 1538874 (Why is no real title available?)
- On \(k\)-anti-traceability of oriented graphs
- Every 8-traceable oriented graph is traceable
- scientific article; zbMATH DE number 4099351 (Why is no real title available?)
- scientific article; zbMATH DE number 3972890 (Why is no real title available?)
This page was built for publication: A traceability conjecture for oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010888)