Spanning cycles in regular matroids without M* (K5) minors

被引：2

作者：

Lai, Hong-Jian ^{[1
]}

Liu, Bolian

Liu, Yan

Shao, Yehong

机构：

[1] W Virginia Univ, Dept Math, Morgantown, WV 26506 USA

[2] Lanzhou Jiaotong Univ, Phys & Software Engn, Sch Math, Lanzhou 730070, Peoples R China

[3] S China Norm Univ, Dept Math, Guangzhou, Peoples R China

[4] Ohio Univ So, Arts Sci, Ironton, OH 45638 USA

来源：

EUROPEAN JOURNAL OF COMBINATORICS | 2008年 / 29卷 / 01期

关键词：

D O I：

10.1016/j.ejc.2006.07.011

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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. (c) 2006 Elsevier Ltd. All rights reserved.

引用

页码：298 / 310

页数：13

共 24 条

[1]

[Anonymous], 1979, Graph Theory

[2] EVERY PLANAR MAP IS 4 COLORABLE .2. REDUCIBILITY [J].

APPEL, K ;

HAKEN, W ;

KOCH, J .

ILLINOIS JOURNAL OF MATHEMATICS, 1977, 21 (03) :491-567

[3]

Appel K., 1977, Illinois J. of Math, V21, P429

[4]

Boesch F. T., 1977, J. Graph Theory, V1, P79, DOI DOI 10.1002/JGT.3190010115

[5]

Bondy J.A., 2008, GRAD TEXTS MATH

[6]

Catlin P.A., 1991, GRAPH THEORY COMBINA, V1, P207

[7] A REDUCTION METHOD TO FIND SPANNING EULERIAN SUBGRAPHS [J].

CATLIN, PA .

JOURNAL OF GRAPH THEORY, 1988, 12 (01) :29-44

[8] Graphs without spanning closed trails [J].

Catlin, PA ;

Han, ZY ;

Lai, HJ .

DISCRETE MATHEMATICS, 1996, 160 (1-3) :81-91

[9]

CATLIN PA, UNPUB EDGE CONNECTIV

[10] NOTE ON SUB-EULERIAN GRAPHS [J].

JAEGER, F .

JOURNAL OF GRAPH THEORY, 1979, 3 (01) :91-93

← 1 2 3 →