Author:
GODDYN LUIS A.,JACKSON BILL
Abstract
We show that, if M is a connected binary matroid of cogirth
at least five which does not have both an F7-minor and an
F*7-minor, then M has a circuit C
such that M − C is connected and
r(M − C) = r(M).
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Dominating circuits in regular matroids;Advances in Applied Mathematics;2014-02
2. Matroidal Methods in Graph Theory;Discrete Mathematics and Its Applications;2013-11-26
3. Removing circuits in 3-connected binary matroids;Discrete Mathematics;2009-03
4. Contractible bonds in graphs;Journal of Combinatorial Theory, Series B;2005-03
5. Non-separating cocircuits in binary matroids;Linear Algebra and its Applications;2004-05