Traceability of k-traceable oriented graphs
From MaRDI portal
Traceability of \(k\)-traceable oriented graphs
Recommendations
Cites work
- A traceability conjecture for oriented graphs
- Every finite strongly connected digraph of stability 2 has a Hamiltonian path
- scientific article; zbMATH DE number 3838057 (Why is no real title available?)
- Hypotraceable digraphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Independent sets which meet all longest paths
- Longest path partitions in generalizations of tournaments
- Progress on the traceability conjecture for oriented graphs
- Significant differences between path partitions in directed and undirected graphs
- Stable set meeting every longest path
- The directed path partition conjecture
Cited in
(18)- Traceability of line graphs
- An iterative approach to the traceability conjecture for oriented graphs
- The order of hypotraceable oriented graphs
- Every 8-traceable oriented graph is traceable
- Characterizations of k-traceable graphs and oriented graphs
- Traceable property of extended locally in(out)-semicomplete digraph
- On arc-traceable tournaments
- Progress on the traceability conjecture for oriented graphs
- scientific article; zbMATH DE number 3972886 (Why is no real title available?)
- Computational results on the traceability of oriented graphs of small order
- The existence of planar hypotraceable oriented graphs
- scientific article; zbMATH DE number 4189769 (Why is no real title available?)
- Forbidden subdigraphs conditions on the traceability conjecture
- Cycles in \(k\)-traceable oriented graphs
- On k-anti-traceability of oriented graphs
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- A linear bound towards the traceability conjecture
- Triangle-free oriented graphs and the traceability conjecture
This page was built for publication: Traceability of \(k\)-traceable oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q965994)