Recommendations
Cited in
(24)- Improved bounds on the planar branchwidth with respect to the largest grid minor size
- The branchwidth of graphs and their cycle matroids
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- Packing topological minors half‐integrally
- A partial k-arboretum of graphs with bounded treewidth
- Call routing and the ratcatcher
- Graph minors. XIX: Well-quasi-ordering on a surface.
- The Induced Disjoint Paths Problem
- Graph minors. XVII: Taming a vortex
- Graph minors. XII: Distance on a surface
- Rank-width and tree-width of \(H\)-minor-free graphs
- A survey of parameterized algorithms and the complexity of edge modification
- Some recent progress and applications in graph minor theory
- Excluding subdivisions of bounded degree graphs
- Catalan structures and dynamic programming in \(H\)-minor-free graphs
- Subexponential parameterized algorithms
- The theory of guaranteed search on graphs
- A linear time algorithm for the induced disjoint paths problem in planar graphs
- Approximation algorithms via contraction decomposition
- Circuits in graphs embedded on the torus
- Algorithms for finding an induced cycle in planar graphs
- A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem
- Grids and their minors
- Fixed-parameter tractability of treewidth and pathwidth
This page was built for publication: Graph minors. XI: Circuits on a surface
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322009)
