Computational Results on the Traceability of Oriented Graphs of Small Order
Author:
Open Access
- 14 October 2013
- journal article
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 20 (4) , P23
Abstract
A digraph $D$ is traceable if it contains a path visiting every vertex, and hypotraceable if $D$ is not traceable, but $D-v$ is traceable for every vertex $v\in V(D)$. Van Aardt, Frick, Katrenič and Nielsen [Discrete Math. 11(2011), 1273-1280] showed that there exists a hypotraceable oriented graph of order $n$ for every $n\geq 8$, except possibly for $n=9$ or $11$. These two outstanding existence questions for hypotraceable oriented graphs are settled in this paper --- the first in the negative and the second in the affirmative. Furthermore, $D$ is $k$-traceable if $D$ has at least $k$ vertices and each of its induced subdigraphs of order $k$ is traceable. It is known that for $k\leq 6$ every k-traceable oriented graph is traceable and that for $k=7$ and each $k\geq 9$ there exist nontraceable $k$-traceable oriented graphs of order $k+1$. The Traceability Conjecture states that for $k\geq 2$ every $k$-traceable oriented graph of order $n\geq 2k-1$ is traceable. In this paper it is shown via computer searches that all $7$-traceable and $8$-traceable oriented graphs of orders $9$, $10$ and $11$ are traceable, and that all $9$-traceable oriented graphs of order $11$ are traceable. All hypotraceable graphs of order $10$ are also found. Recently, these results are used to prove that the Traceability Conjecture also holds for $k =7, 8$ and 9, except possibly when $k=9$ and $22\leq n\leq 32$.
Keywords
This publication has 12 references indexed in Scilit:
- An Iterative Approach to the Traceability Conjecture for Oriented GraphsThe Electronic Journal of Combinatorics, 2013
- Cycles in -traceable oriented graphsDiscrete Mathematics, 2011
- The order of hypotraceable oriented graphsDiscrete Mathematics, 2011
- Traceability of k-traceable oriented graphsDiscrete Mathematics, 2010
- Independent sets and non-augmentable paths in generalizations of tournamentsDiscrete Mathematics, 2008
- A Traceability Conjecture for Oriented GraphsThe Electronic Journal of Combinatorics, 2008
- Longest path partitions in generalizations of tournamentsDiscrete Mathematics, 2006
- Stable set meeting every longest pathDiscrete Mathematics, 2004
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facetsDiscrete Mathematics, 1981
- On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets1981