Computational results on the traceability of oriented graphs of small order
From MaRDI portal
(Redirected from Publication:396945)
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
- Cycles in \(k\)-traceable oriented graphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Independent sets which meet all longest paths
- Longest path partitions in generalizations of tournaments
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets
- 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
(9)- scientific article; zbMATH DE number 3972886 (Why is no real title available?)
- Traceability of \(k\)-traceable oriented graphs
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- A linear bound towards the traceability conjecture
- Hypohamiltonian oriented graphs of all possible orders
- An iterative approach to the traceability conjecture for oriented graphs
- The order of hypotraceable oriented graphs
- The existence of planar hypotraceable oriented graphs
- Every 8-traceable oriented graph is traceable
This page was built for publication: Computational results on the traceability of oriented graphs of small order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396945)