Graph minors. XI: Circuits on a surface

DOI10.1006/JCTB.1994.1007zbMath0799.05016OpenAlexW1965737603MaRDI QIDQ1322009

Neil Robertson, P. D. 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

zbMATH Keywords

surfacegraph minortangle

Mathematics Subject Classification ID

Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (21)

Call routing and the ratcatcher ⋮ Excluding subdivisions of bounded degree graphs ⋮ Grids and their minors ⋮ Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ The branchwidth of graphs and their cycle matroids ⋮ Some recent progress and applications in graph minor theory ⋮ Improved bounds on the planar branchwidth with respect to the largest grid minor size ⋮ The Induced Disjoint Paths Problem ⋮ A linear time algorithm for the induced disjoint paths problem in planar graphs ⋮ Packing topological minors half‐integrally ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ Approximation algorithms via contraction decomposition ⋮ Unnamed Item ⋮ Catalan structures and dynamic programming in \(H\)-minor-free graphs ⋮ The theory of guaranteed search on graphs ⋮ Subexponential parameterized algorithms ⋮ Graph minors. XIX: Well-quasi-ordering on a surface. ⋮ Algorithms for finding an induced cycle in planar graphs ⋮ Rank-width and tree-width of \(H\)-minor-free graphs ⋮ Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction ⋮ A partial k-arboretum of graphs with bounded treewidth

This page was built for publication: Graph minors. XI: Circuits on a surface