An Iterative Approach to the Traceability Conjecture for Oriented Graphs

[摘要] A digraph is $k$-traceable if its order is at least $k$ and each of its subdigraphs of order $k$ is traceable.  The Traceability Conjecture (TC) states that for $k\geq 2$ every $k$-traceable oriented graph of order at least $2k-1$ is traceable. It has bee

[学科分类] 离散数学和组合数学

[关键词] Traceability Conjecture;Path Partition Conjecture;oriented graph;generalized tournament;traceable;$k$-traceable;longest path.