Computational results on the traceability of oriented graphs of small order
From MaRDI portal
Publication:396945
zbMATH Open1300.05113MaRDI QIDQ396945FDOQ396945
Authors: A. P. Burger 
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
Recommendations
Cites Work
- The order of hypotraceable 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
- Independent sets and non-augmentable paths in generalizations of tournaments
- Longest path partitions in generalizations of tournaments
- Title not available (Why is that?)
- Progress on the traceability conjecture for oriented graphs
- On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets
- The directed path partition conjecture
- Cycles in \(k\)-traceable oriented graphs
- Traceability of \(k\)-traceable oriented graphs
Cited In (9)
- The order of hypotraceable oriented graphs
- Traceability of \(k\)-traceable oriented graphs
- The existence of planar hypotraceable oriented graphs
- An iterative approach to the traceability conjecture for oriented graphs
- Title not available (Why is that?)
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- A linear bound towards the traceability conjecture
- Hypohamiltonian oriented graphs of all possible orders
- 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)
