Computational Results on the Traceability of Oriented Graphs of Small Order

Electronic Journal Of Combinatorics

Alewyn Burger¹ 

关键词: Oriented graph;    tournament;    hypotraceable;    $k$-traceable;    traceability;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A digraph $D$ is traceable if it contains a path visiting every vertex, and hypotraceable if $D$ is not traceable, but $D-v$ is traceable for every vertex $v\in V(D)$. Van Aardt, Frick, Katrenič and Nielsen [Discrete Math. 11(2011), 1273-1280] showed that

【 授权许可】

Others