Explicit bounds for graph minors

DOI10.1016/j.jctb.2018.03.004zbMath1391.05243arXiv1305.1451OpenAlexW2963559342MaRDI QIDQ723881

R. Bruce Richter, Jim Geelen, Tony Huynh, Paul Wollan

Publication date: 24 July 2018

Published in: Journal of Combinatorial Theory. Series B, Surveys in Combinatorics 2022 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.1451

zbMATH Keywords

surfacesminorslinkagesclique minorbranch sets

Mathematics Subject Classification ID

Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths, Shortest path embeddings of graphs on surfaces, Low-dimensional topology. Abstracts from the workshop held January 15--21, 2023, Explicit linear kernels for packing problems, A lower bound on the tree-width of graphs with irrelevant vertices, Discrete systolic inequalities and decompositions of triangulated surfaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XXII. Irrelevant vertices in linkage problems
• Graph minors. XX: Wagner's conjecture
• Generating locally-cyclic triangulations of surfaces
• Graph minors. VII: Disjoint paths on a surface
• Graph minors. XVI: Excluding a non-planar graph
• Graph minors. XIII: The disjoint paths problem
• Untangling two systems of noncrossing curves
• Tight Bounds for Linkages in Planar Graphs
• A simpler algorithm and shorter proof for the graph minor decomposition