Title of article
Spanning cycles in regular matroids without minors
Author/Authors
Lai، نويسنده , , Hong-Jian and Liu، نويسنده , , Bolian and Liu، نويسنده , , Yan and Shao، نويسنده , , Yehong، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
13
From page
298
To page
310
Abstract
Catlin and Jaeger proved that the cycle matroid of a 4-edge-connected graph has a spanning cycle. This result can not be generalized to regular matroids as there exist infinitely many connected cographic matroids, each of which contains a M ∗ ( K 5 ) minor and has arbitrarily large cogirth, that do not have spanning cycles. In this paper, we proved that if a connected regular matroid without a M ∗ ( K 5 ) -minor has cogirth at least 4, then it has a spanning cycle.
Journal title
European Journal of Combinatorics
Serial Year
2008
Journal title
European Journal of Combinatorics
Record number
1546068
Link To Document