The Structure and Number of Obstructions to Treewidth
From MaRDI portal
Recommendations
Cited in
(18)- The structure of obstructions to treewidth and pathwidth
- A branch-and-price-and-cut method for computing an optimal bramble
- Minor obstructions for apex-pseudoforests
- Sparse obstructions for minor-covering parameters
- Contraction obstructions for treewidth
- Obstructions for tree-depth
- Graph minors and parameterized algorithm design
- Differential geometric treewidth estimation in adiabatic quantum computation
- Characterizing width two for variants of treewidth
- scientific article; zbMATH DE number 475617 (Why is no real title available?)
- On making a distinguished vertex of minimum degree by vertex deletion
- Weighted Treewidth Algorithmic Techniques and Results
- Treewidth computations. II. Lower bounds
- k-apices of minor-closed graph classes. I: Bounding the obstructions
- A lower bound for treewidth and its consequences
- Graph parameters, universal obstructions, and WQO
- Achievable sets, brambles, and sparse treewidth obstructions
- Treewidth lower bounds with brambles
This page was built for publication: The Structure and Number of Obstructions to Treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3128210)