An iterative approach to the traceability conjecture for oriented graphs

zbMath1266.05044MaRDI QIDQ1953448

Marietjie Frick, Joy E. Singleton, Jean E. Dunbar, John M. Harris, Susan A. van Aardt, Alewyn P. Burger

Publication date: 7 June 2013

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i1p59

zbMATH Keywords

oriented graphlongest pathtraceable\(k\)-traceablepath partition conjecturetraceability conjecturegeneralized tournament

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

Every 8-traceable oriented graph is traceable ⋮ Computational results on the traceability of oriented graphs of small order ⋮ Forbidden subdigraphs conditions on the traceability conjecture ⋮ A linear bound towards the traceability conjecture ⋮ Triangle-free oriented graphs and the traceability conjecture ⋮ Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs

This page was built for publication: An iterative approach to the traceability conjecture for oriented graphs