On a Conjecture of Thomassen
[摘要] 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
[发布日期] [发布机构]
[效力级别] [学科分类] 离散数学和组合数学
[关键词] Graph connectivity;digraphs;Thomassen [时效性]