%0 Journal Article
%T Progress on the Traceability Conjecture for Oriented Graphs
%A Marietjie Frick
%A Peter Katreni£¿
%J Discrete Mathematics & Theoretical Computer Science
%D 2008
%I Discrete Mathematics & Theoretical Computer Science
%X A digraph is k-traceable if each of its induced subdigraphs of order k is traceable. The Traceability Conjecture is that for k ¡Ý 2 every k-traceable oriented graph of order at least 2k-1 is traceable. The conjecture has been proved for k ¡Ü 5. We prove that it also holds for k=6.
%U http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/965