On a Conjecture of Thomassen

Electronic Journal Of Combinatorics

Michelle Delcourt¹ 

关键词: Graph connectivity;    digraphs;    Thomassen;   

DOI  :  

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

来源: Electronic Journal Of Combinatorics

【 摘 要 】

In 1989, Thomassen asked whether there is an integer-valued function $f(k)$ such that every $f(k)$-connected graph admits a spanning, bipartite $k$-connected subgraph. In this paper we take a first, humble approach, showing the conjecture is true up to a

【 授权许可】

Others