article

Graph minors. V. Excluding a planar graph

Authors:

Neil Robertson,

P D SeymourAuthors Info & Claims

Journal of Combinatorial Theory Series B, Volume 41, Issue 1

Pages 92 - 114

https://doi.org/10.1016/0095-8956(86)90030-4

Published: 01 August 1986 Publication History

Abstract

No abstract available.

Cited By

View all

Giannopoulou AWiederrecht SMohar BShinkar IO'Donnell R(2024)A Flat Wall Theorem for Matching Minors in Bipartite GraphsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649774(716-727)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649774
Gorsky MKawarabayashi KKreutzer SWiederrecht SMohar BShinkar IO'Donnell R(2024)Packing Even Directed Circuits Quarter-IntegrallyProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649682(692-703)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649682
Bousquet NFeuilloley LPierron T(2024)Local certification of graph decompositions and applications to minor-free classesJournal of Parallel and Distributed Computing10.1016/j.jpdc.2024.104954193:COnline publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1016/j.jpdc.2024.104954
Show More Cited By

Index Terms

Graph minors. V. Excluding a planar graph

Recommendations

Graph minors. XVI. excluding a non-planar graph

This paper contains the cornerstone theorem of the series. We study the structure of graphs with no minor isomorphic to a fixed graph L, when L is non-planar. (The case when L is planar was studied in an earlier paper.) We find that every graph with no ...
Excluding a planar graph from GF(q)-representable matroids

We prove that a binary matroid with huge branch-width contains the cycle matroid of a large grid as a minor. This implies that an infinite antichain of binary matroids cannot contain the cycle matroid of a planar graph. The result also holds for any ...
Graph minors and algorithms

Comments

Information & Contributors

Information

Published In

cover image Journal of Combinatorial Theory Series B

Journal of Combinatorial Theory Series B Volume 41, Issue 1

Aug. 1986

138 pages

ISSN:0095-8956

Editors:
Adrian Bondy,
U S Murty

Issue’s Table of Contents

Publisher

Academic Press, Inc.

United States

Publication History

Published: 01 August 1986

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

217
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Giannopoulou AWiederrecht SMohar BShinkar IO'Donnell R(2024)A Flat Wall Theorem for Matching Minors in Bipartite GraphsProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649774(716-727)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649774
Gorsky MKawarabayashi KKreutzer SWiederrecht SMohar BShinkar IO'Donnell R(2024)Packing Even Directed Circuits Quarter-IntegrallyProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649682(692-703)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649682
Bousquet NFeuilloley LPierron T(2024)Local certification of graph decompositions and applications to minor-free classesJournal of Parallel and Distributed Computing10.1016/j.jpdc.2024.104954193:COnline publication date: 1-Nov-2024
https://dl.acm.org/doi/10.1016/j.jpdc.2024.104954
Dallard CMilanič MŠtorgel K(2024)Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structureJournal of Combinatorial Theory Series B10.1016/j.jctb.2024.03.005167:C(338-391)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1016/j.jctb.2024.03.005
Bonamy MBonnet ÉDéprés HEsperet LGeniet CHilaire CThomassé SWesolek A(2024)Sparse graphs with bounded induced cycle packing number have logarithmic treewidthJournal of Combinatorial Theory Series B10.1016/j.jctb.2024.03.003167:C(215-249)Online publication date: 1-Jul-2024
https://dl.acm.org/doi/10.1016/j.jctb.2024.03.003
Abrishami TAlecu BChudnovsky MHajebi SSpirkl S(2024)Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphsJournal of Combinatorial Theory Series B10.1016/j.jctb.2023.10.008164:C(443-472)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1016/j.jctb.2023.10.008
Abrishami TChudnovsky MDibek CHajebi SRzążewski PSpirkl SVušković K(2024)Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degreeJournal of Combinatorial Theory Series B10.1016/j.jctb.2023.10.005164:C(371-403)Online publication date: 1-Jan-2024
https://dl.acm.org/doi/10.1016/j.jctb.2023.10.005
Cocks D(2024) t-sails and sparse hereditary classes of unbounded tree-widthEuropean Journal of Combinatorics10.1016/j.ejc.2024.104005122:COnline publication date: 1-Dec-2024
https://dl.acm.org/doi/10.1016/j.ejc.2024.104005
Kim DOum S(2024)Vertex-minors of graphsDiscrete Applied Mathematics10.1016/j.dam.2024.03.011351:C(54-73)Online publication date: 15-Jul-2024
https://dl.acm.org/doi/10.1016/j.dam.2024.03.011
Goles EMontealegre PRíos-Wilson MTheyssier G(2024)On the parameterized complexity of freezing dynamicsAdvances in Applied Mathematics10.1016/j.aam.2024.102706157:COnline publication date: 1-Jun-2024
https://dl.acm.org/doi/10.1016/j.aam.2024.102706
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Graph minors. XVI. excluding a non-planar graph

Excluding a planar graph from GF(q)-representable matroids

Graph minors and algorithms

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations