The Existence of Planar Hypotraceable Oriented Graphs

Abstract : A digraph is \emph{traceable} if it has a path that visits every vertex. A digraph $D$ is \emph{hypotraceable} if $D$ is not traceable but $D-v$ is traceable for every vertex $v\in V(D)$. It is known that there exists a planar hypotraceable digraph of order $n$ for every $n\geq 7$, but no examples of planar hypotraceable oriented graphs (digraphs without 2-cycles) have yet appeared in the literature. We show that there exists a planar hypotraceable oriented graph of order $n$ for every even $n \geq 10$, with the possible exception of $n = 14$.
Keywords :
Document type :
Journal articles
Domain :

Cited literature [21 references]

https://hal.archives-ouvertes.fr/hal-01218431
Contributor : Alewyn Burger <>
Submitted on : Tuesday, February 14, 2017 - 10:34:52 AM
Last modification on : Thursday, March 16, 2017 - 2:27:10 PM
Long-term archiving on: : Monday, May 15, 2017 - 1:05:23 PM

File

planarhypotrFinal.pdf
Files produced by the author(s)

Identifiers

• HAL Id : hal-01218431, version 2

Citation

Susan van Aardt, Alewyn Petrus Burger, Marietjie Frick. The Existence of Planar Hypotraceable Oriented Graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2017, Vol 19 no. 1. ⟨hal-01218431v2⟩

Record views