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.
@article{bwmeta1.element.doi-10_7151_dmgt_1966,
author = {Susan A. van Aardt},
title = {Every 8-Traceable Oriented Graph Is Traceable},
journal = {Discussiones Mathematicae Graph Theory},
volume = {37},
year = {2017},
pages = {963-973},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1966}
}
Susan A. van Aardt. Every 8-Traceable Oriented Graph Is Traceable. Discussiones Mathematicae Graph Theory, Tome 37 (2017) pp. 963-973. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1966/