Graph minors. XI: Circuits on a surface
From MaRDI portal
Publication:1322009
DOI10.1006/JCTB.1994.1007zbMATH Open0799.05016OpenAlexW1965737603MaRDI QIDQ1322009FDOQ1322009
Authors: Neil Robertson, Paul Seymour 
Publication date: 14 November 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1007
Recommendations
Cited In (24)
- The branchwidth of graphs and their cycle matroids
- Packing topological minors half‐integrally
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction
- A partial k-arboretum of graphs with bounded treewidth
- Call routing and the ratcatcher
- The Induced Disjoint Paths Problem
- Graph minors. XIX: Well-quasi-ordering on a surface.
- Graph minors. XVII: Taming a vortex
- Graph minors. XII: Distance on a surface
- A survey of parameterized algorithms and the complexity of edge modification
- Rank-width and tree-width of \(H\)-minor-free graphs
- 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
- Improved bounds on the planar branchwidth with respect to the largest grid minor size
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)
