Linkages in Large Graphs of Bounded Tree-Width

Abstract

We show that all sufficiently large (2k+3)-connected graphs of bounded tree-width are k-linked. Thomassen has conjectured that all sufficiently large (2k+2)-connected graphs are k-linked.

68 pages, 1 figure

References in corpus (1)

• K_6 minors in 6-connected graphs of bounded tree-width

Cited by in corpus (1)

• 7-Connected Graphs are 4-Ordered