970 citations · 1.7k across the 49 of their papers we have counts for
1 paper · 2 filters
Jan-Oliver Fröhlich, Ken-ichi Kawarabayashi, Theodor Müller +2
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-…