Spanning a strong digraph by α circuits:: A proof of Gallai's conjecture

被引：9
|
作者：
Bessy, Stephane [1 ]
Thomasse, Stephan [1 ]
机构：
[1] Univ Montpellier 2, LIRMM, F-34392 Montpellier 5, France
来源：
COMBINATORICA | 2007年 / 27卷 / 06期
关键词：
05C20; 05C38; 05C69; 05C70;
D O I：
10.1007/s00493-007-2073-3
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In 1963, Tibor Gallai [9] asked whether every strongly connected directed graph D is spanned by a directed circiuits, where alpha is the stability of D. We give a proof of this conjecture.
引用
收藏
页码：659 / 667
页数：9
相关论文
共 50 条
12345