EVERY 8-TRACEABLE ORIENTED GRAPH IS TRACEABLE

被引：2
|
作者：
van Aardt, Susan A. [1 ]
机构：
[1] Univ South Africa, Dept Math Sci, POB 392, ZA-0003 Unisa, South Africa
来源：
DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2017年 / 37卷 / 04期
基金：
新加坡国家研究基金会;
关键词：
oriented graph; traceable; hypotraceable; k-traceable; generalized tournament;
D O I：
10.7151/dmgt.1966
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：963 / 973
页数：11
相关论文
共 50 条
12345