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

2007/03/08 by Jim Geelen, Bert Gerards, Geoff Whittle · 23 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Antichain #Arithmetic #Binary number #Combinatorics #Discrete mathematics #Graph #Graphic matroid #Interconnection Networks and Systems #Limits and Structures in Graph Theory #Mathematics #Matroid #Matroid partitioning #Oriented matroid #Partially ordered set #Planar graph #Scroll

paper · doi:10.1016/j.jctb.2007.02.005

published in Journal of Combinatorial Theory, Series B 97(6), 971-998 (Elsevier BV)

openalex publication_date 2007/03/08 · crossref created 2007/03/08 · crossref issued 2007/11/01 · crossref published 2007/11/01 · crossref published-print 2007/11/01 · crossref deposited 2023/05/10 · openalex created_date 2025/10/10 · crossref indexed 2026/04/08 · openalex updated_date 2026/08/01

Citations

• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
• Graph minors. V. Excluding a planar graph
• On the excluded minors for the matroids of branch-width k
• Recognizing graphic matroids

Cited by

• Some Recent Progress and Applications in Graph Minor Theory
• Branch-decomposition [wikipedia]