Square roots of minor closed graph classes
From MaRDI portal
Recommendations
Cites work
- A criterion for planarity of the square of a graph
- Branch decompositions and minor containment
- Call routing and the ratcatcher
- Constructive linear time algorithms for branchwidth
- Faster parameterized algorithms for minor containment
- Graph minors. V. Excluding a planar graph
- Graph minors. X: Obstructions to tree-decomposition
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XX: Wagner's conjecture
Cited in
(4)
This page was built for publication: Square roots of minor closed graph classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2857427)