On the excluded minors for the matroids of branch-width k

2003/02/04 by Jim Geelen, J.F. Geelen, A.M.H. Gerards +4 · 29 citations
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Artificial intelligence #Class (philosophy) #Combinatorics #Computer science #Graph Labeling and Dimension Problems #Mathematics #Matroid #graph theory and CDMA systems

paper · open access · doi:10.1016/s0095-8956(02)00046-1

published in Journal of Combinatorial Theory, Series B 88(2), 261-265 (Elsevier BV)

openalex publication_date 2003/02/04 · crossref created 2003/02/04 · crossref issued 2003/07/01 · crossref published 2003/07/01 · crossref published-print 2003/07/01 · crossref deposited 2019/03/30 · crossref indexed 2025/09/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Citations

• On Matroids of Branch-Width Three
• Branch-Width and Well-Quasi-Ordering in Matroids and Graphs
• Graph minors. X. Obstructions to tree-decomposition

Cited by

• Excluding a planar graph from GF ( q ) -representable matroids
• Matroid tree-width
• Finding Branch-Decompositions and Rank-Decompositions
• Rank-width and vertex-minors
• Some Recent Progress and Applications in Graph Minor Theory
• Branch-decomposition [wikipedia]