Supereulerian graphs and the Petersen graph

被引:12
作者
Catlin, PA [1 ]
Lai, HJ [1 ]
机构
[1] W VIRGINIA UNIV,DEPT MATH,MORGANTOWN,WV 26506
关键词
D O I
10.1006/jctb.1996.0009
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Any 3-edge-connected graph with at most 10 edge cuts of size 3 either has a spanning closed trail or it is contractible to the Petersen graph. (C) 1996 Academic Press, Inc.
引用
收藏
页码:123 / 139
页数:17
相关论文
共 20 条
[1]  
[Anonymous], COMMUNICATION
[2]  
BONDY JA, 1907, GRAPH THEORY APPLICA
[3]  
Catlin P., 1987, Congr. Numer., V58, P233
[4]  
Catlin P. A., 1990, C NUMER, V76, P173
[5]   A REDUCTION METHOD TO FIND SPANNING EULERIAN SUBGRAPHS [J].
CATLIN, PA .
JOURNAL OF GRAPH THEORY, 1988, 12 (01) :29-44
[6]  
CATLIN PA, 1988, ARS COMBINATORIA, V25, P115
[7]  
CATLIN PA, IN PRESS DISCRETE MA
[8]  
CHEN ZH, IN PRESS ARS COMBIN
[9]  
Chetwynd A. G., 1981, THEORY APPL GRAPHS, P215
[10]   CYCLES THROUGH 10 VERTICES IN 3-CONNECTED CUBIC GRAPHS [J].
ELLINGHAM, MN ;
HOLTON, DA ;
LITTLE, CHC .
COMBINATORICA, 1984, 4 (04) :265-273