Back to Search
Start Over
Spanning cycles in regular matroids without minors
- Source :
-
European Journal of Combinatorics . Jan2008, Vol. 29 Issue 1, p298-310. 13p. - Publication Year :
- 2008
-
Abstract
- 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 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 -minor has cogirth at least 4, then it has a spanning cycle. [Copyright &y& Elsevier]
- Subjects :
- *GRAPH theory
*ALGEBRA
*COMBINATORICS
*TOPOLOGY
Subjects
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 29
- Issue :
- 1
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 27334184
- Full Text :
- https://doi.org/10.1016/j.ejc.2006.07.011