Every 8-traceable oriented graph is traceable
From MaRDI portal
Publication:2409787
Recommendations
Cites work
- A traceability conjecture for oriented graphs
- An iterative approach to the traceability conjecture for oriented graphs
- Computational results on the traceability of oriented graphs of small order
- Cycles in \(k\)-traceable oriented graphs
- Digraphs
- scientific article; zbMATH DE number 3849274 (Why is no real title available?)
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- Progress on the traceability conjecture for oriented graphs
- The order of hypotraceable oriented graphs
- Traceability of k-traceable oriented graphs
Cited in
(7)- The order of hypotraceable oriented graphs
- Characterizations of k-traceable graphs and oriented graphs
- Computational results on the traceability of oriented graphs of small order
- The existence of planar hypotraceable oriented graphs
- Forbidden subdigraphs conditions on the traceability conjecture
- On k-anti-traceability of oriented graphs
- Traceability of k-traceable oriented graphs
This page was built for publication: Every 8-traceable oriented graph is traceable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2409787)