Graph minors. XVII: Taming a vortex

DOI10.1006/JCTB.1999.1919MaRDI QIDQ1569044zbMATH OpenOpenAlexFDO

Authors Neil Robertson, Paul Seymour

Publication date 25 June 2000

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1999.1919

zbMATH Keywords

embedded graphgenussurface

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83)

Recommendations

• Graph minors. XVI: Excluding a non-planar graph
• Graph minors. XV: Giant steps
• The excluded minor structure theorem with planarly embedded wall
• Graph minors. XI: Circuits on a surface
• Graph minors. XIX: Well-quasi-ordering on a surface.

Cites work

• Graph minors. X: Obstructions to tree-decomposition
• Graph minors. XVI: Excluding a non-planar graph

Cited in

(22)

• Linear connectivity forces large complete bipartite minors
• Graph minors. XXI. graphs with unique linkages
• A partial k-arboretum of graphs with bounded treewidth
• Graph minors. XIX: Well-quasi-ordering on a surface.
• On the immersion relation and an embedding problem for infinite graphs
• On the excluded minor structure theorem for graphs of large tree-width
• Turing kernelization for finding long paths in graph classes excluding a topological minor
• Fixed-parameter tractability of treewidth and pathwidth
• Graph minors and parameterized algorithm design
• Graph minor theory
• The Erdős-Pósa property for clique minors in highly connected graphs
• Turing kernelization for finding long paths in graphs excluding a topological minor
• The excluded minor structure theorem with planarly embedded wall
• Linear connectivity forces large complete bipartite minors: an alternative approach
• Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
• On graph classes with minor-universal elements
• Excluding disjoint Kuratowski graphs
• On the size of two minimal linkages
• Excluding a clique or a biclique in graphs of bounded induced matching treewidth
• Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
• Graph minors. XX: Wagner's conjecture
• Some recent progress and applications in graph minor theory

This page was built for publication: Graph minors. XVII: Taming a vortex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1569044)