Linkages in Large Graphs of Bounded Tree-Width
classification
🧮 math.CO
keywords
graphslargeboundedconnectedk-linkedsufficientlytree-widthconjectured
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.