Branch-Width and Well-Quasi-Ordering in Matroids and Graphs

2002/03/01 by James F. Geelen, A.M.H. Gerards, Geoff Whittle · 65 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Bounded function #Class (philosophy) #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Graphic matroid #Interconnection Networks and Systems #Mathematical analysis #Mathematics #Matroid #Tree (set theory)

paper · open access · doi:10.1006/jctb.2001.2082

published in Journal of Combinatorial Theory, Series B 84(2), 270-290 (Elsevier BV)

crossref issued 2002/03/01 · crossref published 2002/03/01 · crossref published-print 2002/03/01 · openalex publication_date 2002/03/01 · crossref created 2002/10/06 · crossref deposited 2019/04/11 · openalex created_date 2025/10/10 · crossref indexed 2026/02/26 · openalex updated_date 2026/08/01

Cited by

• On Matroids of Branch-Width Three
• Excluding a planar graph from GF ( q ) -representable matroids
• On the excluded minors for the matroids of branch-width k
• The branchwidth of graphs and their cycle matroids
• Matroid tree-width
• Rank-width and vertex-minors
• On a Generalization of Spikes
• Some Recent Progress and Applications in Graph Minor Theory
• Branch-decomposition [wikipedia]