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.
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
If the library membership card is not in the list,
add a new one.
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|
Source: Personal bibliographies
and: SICRIS
The material is available in full text. If you wish to order the material anyway, click the Continue button.