Author:
BELLENBAUM PATRICK,DIESTEL REINHARD
Abstract
We give short proofs of the following two results: Thomas's theorem that every finite graph
has a linked tree-decomposition of width no greater than its tree-width; and the ‘tree-width
duality theorem’ of Seymour and Thomas, that the tree-width of a finite graph is exactly
one less than the largest order of its brambles.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A Single-Exponential Time 2-Approximation Algorithm for Treewidth;SIAM Journal on Computing;2023-11-14
2. Dynamic treewidth;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
3. k-apices of minor-closed graph classes. I. Bounding the obstructions;Journal of Combinatorial Theory, Series B;2023-07
4. An Improved Parameterized Algorithm for Treewidth;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
5. The mixed search game against an agile and visible fugitive is monotone;Discrete Mathematics;2023-04