# Every 8-Traceable Oriented Graph Is Traceable

Discussiones Mathematicae Graph Theory (2017)

- Volume: 37, Issue: 4, page 963-973
- ISSN: 2083-5892

## Access Full Article

top## Abstract

top## How to cite

topSusan A. van Aardt. "Every 8-Traceable Oriented Graph Is Traceable." Discussiones Mathematicae Graph Theory 37.4 (2017): 963-973. <http://eudml.org/doc/288404>.

@article{SusanA2017,

abstract = {A digraph of order n is k-traceable if n ≥ k and each of its induced subdigraphs of order k is traceable. It is known that if 2 ≤ k ≤ 6, every k-traceable oriented graph is traceable but for k = 7 and for each k ≥ 9, there exist k-traceable oriented graphs that are nontraceable. We show that every 8-traceable oriented graph is traceable.},

author = {Susan A. van Aardt},

journal = {Discussiones Mathematicae Graph Theory},

keywords = {oriented graph; traceable; hypotraceable; k-traceable; generalized tournament},

language = {eng},

number = {4},

pages = {963-973},

title = {Every 8-Traceable Oriented Graph Is Traceable},

url = {http://eudml.org/doc/288404},

volume = {37},

year = {2017},

}

TY - JOUR

AU - Susan A. van Aardt

TI - Every 8-Traceable Oriented Graph Is Traceable

JO - Discussiones Mathematicae Graph Theory

PY - 2017

VL - 37

IS - 4

SP - 963

EP - 973

AB - A digraph of order n is k-traceable if n ≥ k and each of its induced subdigraphs of order k is traceable. It is known that if 2 ≤ k ≤ 6, every k-traceable oriented graph is traceable but for k = 7 and for each k ≥ 9, there exist k-traceable oriented graphs that are nontraceable. We show that every 8-traceable oriented graph is traceable.

LA - eng

KW - oriented graph; traceable; hypotraceable; k-traceable; generalized tournament

UR - http://eudml.org/doc/288404

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.