The structure of obstructions to treewidth and pathwidth
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3906520 (Why is no real title available?)
- scientific article; zbMATH DE number 772777 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A characterization of partial 3-trees
- Forbidden minors characterization of partial 3-trees
- Graph minors. XIII: The disjoint paths problem
- Obstruction set isolation for the gate matrix layout problem
- On Linear Recognition of Tree-Width at Most Four
- Representation of a finite graph by a set of intervals on the real line
- The Structure and Number of Obstructions to Treewidth
- The vertex separation number of a graph equals its path-width
Cited in
(13)- Outerplanar obstructions for matroid pathwidth
- Operations which preserve path-width at most two
- Graph minors and parameterized algorithm design
- Achievable sets, brambles, and sparse treewidth obstructions
- A lower bound for treewidth and its consequences
- Contraction obstructions for treewidth
- \(t\)-sails and sparse hereditary classes of unbounded tree-width
- Characterizing graphs of small carving-width
- Minor obstructions for apex-pseudoforests
- Confronting intractability via parameters
- Characterizing width two for variants of treewidth
- Sparse obstructions for minor-covering parameters
- Automated testing and interactive construction of unavoidable sets for graph classes of small path‐width
This page was built for publication: The structure of obstructions to treewidth and pathwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613365)
