Computational results on the traceability of oriented graphs of small order
From MaRDI portal
Publication:396945
zbMath1300.05113MaRDI QIDQ396945
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i4p23
Related Items (4)
Every 8-traceable oriented graph is traceable ⋮ A linear bound towards the traceability conjecture ⋮ Hypohamiltonian oriented graphs of all possible orders ⋮ Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Cycles in \(k\)-traceable oriented graphs
- Traceability of \(k\)-traceable oriented graphs
- A traceability conjecture for oriented graphs
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- Stable set meeting every longest path
- Independent sets which meet all longest paths
- An iterative approach to the traceability conjecture for oriented graphs
- The order of hypotraceable oriented graphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Longest path partitions in generalizations of tournaments
- On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets
- The directed path partition conjecture
This page was built for publication: Computational results on the traceability of oriented graphs of small order