Author:
Geelen Jim,Gerards Bert,Whittle Geoff
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. On the maximal number of disjoint circuits of a graph;Erdős;Publ. Math. Debrecen,1962
2. Branch-width and Rota's Conjecture;Geelen;J. Combin. Theory Ser. B,2002
3. Cliques in dense GF(q)-representable matroids;Geelen;J. Combin. Theory Ser. B,2003
4. Branch-width and well-quasi-ordering in matroids and graphs;Geelen;J. Combin. Theory Ser. B,2002
5. On the excluded-minors for the matroids of branch-width k;Geelen;J. Combin. Theory Ser. B,2003
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Vertex-minors of graphs: A survey;Discrete Applied Mathematics;2024-07
2. Intertwining Connectivities for Vertex-Minors and Pivot-Minors;SIAM Journal on Discrete Mathematics;2023-02-07
3. The binary matroids with no odd circuits of size exceeding five;Journal of Combinatorial Theory, Series B;2022-01
4. Obstructions for bounded shrub-depth and rank-depth;Journal of Combinatorial Theory, Series B;2021-07
5. The Grid Theorem for vertex-minors;Journal of Combinatorial Theory, Series B;2020-09