A simple proof of the tree-width duality theorem
From MaRDI portal
Abstract: We give a simple proof of 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.
This page was built for publication: A simple proof of the tree-width duality theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6244666)
