E-resources
Peer reviewed
Open access
-
van Aardt, Susan; Burger, Alewyn Petrus; Frick, Marietjie
DOAJ (DOAJ: Directory of Open Access Journals), 01/2017, Volume: 19, Issue: 1Journal Article
A digraph is \emph{traceable} if it has a path that visits every vertex. A digraph DD is \emph{hypotraceable} if DD is not traceable but D−vD−v is traceable for every vertex v∈V(D)v∈V(D). It is known that there exists a planar hypotraceable digraph of order nn for every n≥7n≥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 nn for every even n≥10n≥10, with the possible exception of n=14n=14.
