Author:
Geelen James,Whittle Geoff
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Minimal partition of a matroid into independent sets;Edmonds;J. Res. Nat. Bur. Standards Sect. B.,1965
2. Disjoint cocircuits in matroids with large rank;Geelen;J. Combin. Theory Ser. B,2003
3. Excluding the cycle geometries of the Kuratowski graphs from binary geometries;Kung;Proc. London Math. Soc.,1987
4. The long-line graph of a combinatorial geometry. I. Excluding M(K4) and the (q+2)-point line as minors;Kung;Quart. J. Math. Oxford,1988
5. J.P.S. Kung, Extremal matroid theory, in: N. Robertson, P.D. Seymour (Eds.), Graph Structure Theory, Amer. Math. Soc., Providence, RI, 1993, pp. 21–61.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献