Indexed metadata
Two Short Proofs Concerning Tree-Decompositions
PATRICK BELLENBAUM, REINHARD DIESTEL
Source record
Source: Crossref
Published: Nov 1, 2002
DOI: 10.1017/s0963548302005369
Open original source ↗Source 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.