A note on planar graphs with large width parameters and small grid-minors
From MaRDI portal
Publication:423947
Recommendations
- On planar graphs with large tree-width and small grid minors
- Tree-width and large grid minors in planar graphs
- scientific article; zbMATH DE number 1262812
- On the plane-width of graphs
- On the path-width of planar graphs
- Graph minors. III. Planar tree-width
- On the tree-width of planar graphs
- The plane-width of graphs
- Minor-minimal planar graphs of even branch-width
- Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality
Cites work
- A partial k-arboretum of graphs with bounded treewidth
- All-pairs shortest paths for unweighted undirected graphs in o(mn) time
- Call routing and the ratcatcher
- Graph minors. X: Obstructions to tree-decomposition
- Graph theory
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- On planar graphs with large tree-width and small grid minors
- Optimal branch-decomposition of planar graphs in \(O(n^3)\) time
- Quickly excluding a planar graph
- SOFSEM 2005: Theory and Practice of Computer Science
- Tree-width and large grid minors in planar graphs
- Treewidth lower bounds with brambles
Cited in
(3)
This page was built for publication: A note on planar graphs with large width parameters and small grid-minors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423947)