A linear bound towards the traceability conjecture
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3838057 (Why is no real title available?)
- 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
- Every finite strongly connected digraph of stability 2 has a Hamiltonian path
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- Longest path partitions in generalizations of tournaments
- Progress on the traceability conjecture for oriented graphs
- Stable set meeting every longest path
- The directed path partition conjecture
- The order of hypotraceable oriented graphs
- Traceability of \(k\)-traceable oriented graphs
Cited in
(11)- On \(k\)-anti-traceability of oriented graphs
- Characterizations of \(k\)-traceable graphs and oriented graphs
- Progress on the traceability conjecture for oriented graphs
- Computational results on the traceability of oriented graphs of small order
- Traceability of \(k\)-traceable oriented graphs
- Forbidden subdigraphs conditions on the traceability conjecture
- Triangle-free oriented graphs and the traceability conjecture
- A traceability conjecture for oriented graphs
- Lower bounds for trace reconstruction
- The order of hypotraceable oriented graphs
- Every 8-traceable oriented graph is traceable
This page was built for publication: A linear bound towards the traceability conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q895060)