TY - JOUR
T1 - Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs
AU - Li, Xiangwen
AU - Wang, Chunxiang
AU - Fan, Qiong
AU - Niu, Zhaohong
AU - Xiong, Liming
PY - 2013/3
Y1 - 2013/3
N2 - For integers l and k with l > 0 and k > 0, let C(1,k) denote the family of 2-edge-connected graphs G such that for each bond cut {pipe}S{pipe} ≤ 3, each component of G - S has at least ({pipe}V(G){pipe} - k)/l vertices. In this paper we prove that if G ∈ C(7,0), then G is not supereulerian if and only if G can be contracted to one of the nine specified graphs. Our result extends some earlier results (Catlin and Li in J Adv Math 160:65-69, 1999; Broersma and Xiong in Discrete Appl Math 120:35-43, 2002; Li et al. in Discrete Appl Math 145:422-428, 2005; Li et al. in Discrete Math 309:2937-2942, 2009; Lai and Liang in Discrete Appl Math 159:467-477, 2011).
AB - For integers l and k with l > 0 and k > 0, let C(1,k) denote the family of 2-edge-connected graphs G such that for each bond cut {pipe}S{pipe} ≤ 3, each component of G - S has at least ({pipe}V(G){pipe} - k)/l vertices. In this paper we prove that if G ∈ C(7,0), then G is not supereulerian if and only if G can be contracted to one of the nine specified graphs. Our result extends some earlier results (Catlin and Li in J Adv Math 160:65-69, 1999; Broersma and Xiong in Discrete Appl Math 120:35-43, 2002; Li et al. in Discrete Appl Math 145:422-428, 2005; Li et al. in Discrete Math 309:2937-2942, 2009; Lai and Liang in Discrete Appl Math 159:467-477, 2011).
KW - Collapsible
KW - Eulerian graphs
KW - Supereulerian
UR - http://www.scopus.com/inward/record.url?scp=84874661005&partnerID=8YFLogxK
U2 - 10.1007/s00373-011-1108-0
DO - 10.1007/s00373-011-1108-0
M3 - Article
AN - SCOPUS:84874661005
SN - 0911-0119
VL - 29
SP - 275
EP - 280
JO - Graphs and Combinatorics
JF - Graphs and Combinatorics
IS - 2
ER -