Abstract
Let A be an abelian group with |A| ≥ 4. For integers k and l with k > 0 and l ≥ 0, let \({{\mathcal C}(k, l)}\) denote the family of 2-edge-connected graphs G such that for each edge cut \({S\subseteq E(G)}\) with two or three edges, each component of G − S has at least (|V(G)| − l)/k vertices. In this paper, we show that if G is 3-edge-connected and \({G\in {\mathcal C}(6,5)}\) , then G is not A-connected if and only if G can be A-reduced to the Petersen graph.
Similar content being viewed by others
References
Bondy J.A., Murty U.S.R.: Graph Theory with Applications. American Elsevier, New York (1976)
Broersma H.J., Xiong L.M.: A note on minimun degree conditions for supereulerian graphs. Discrete Appl. Math. 120, 35–43 (2002)
Catlin P.A.: A reduction method to find spanning eulerian subgraphs. J. Graph Theory 12, 29–45 (1988)
Catlin P.A., Han Z.Y., Lai H.-J.: Graphs without spanning closed trails. Discrete Math. 160, 81–91 (1996)
Catlin P.A., Li X.: Supereulerian graphs of minimum degree at least 4. J. Adv. Math. 160, 65–69 (1999)
Chen Z.-H.: Supereulerian graphs and the Petersen graph. J. Comb. Math. Comb. Comput. 9, 70–89 (1991)
Jaeger F.: Flows and generalized coloring theorems in graphs. J. Comb. Theory, B 26, 205–216 (1979)
Jaeger F., Linial N., Payan C., Tarsi N.: Group connectivity of graphsa nonhomogeneous analogue of nowhere zero flow properties. J. Comb. Theory, B 56, 165–182 (1992)
Lai H.-J.: Extending partial nowhere zero 4-flow. J. Graph Theory 30, 277–288 (1999)
Lai H.-J.: Group connectivity of 3-edge-connected chordal graphs. Graphs Comb. 16, 165–176 (2000)
Li D., Lai H.J., Zhan M.: Eulerian subgraphs and Hamilton-connected line graphs. Discrete Appl. Math. 145, 422–428 (2005)
Li X., Li D., Lai H.J.: The Supereulerian graphs in the graph family C(l, k). Discrete Math. 309, 2937–2942 (2009)
St. J.A. Nash-Williams, C.: Decompositions of finite graphs into forests. J. Lond. Math. Soc. 39, 12 (1964)
Tutte W.T.: A contribution on the theory of chromatic polynomial. Canad. J. Math. 6, 80–91 (1954)
Tutte W.T.: On the algebraic theory of graph colorings. J. Comb. Theory 1, 15–50 (1966)
Yao X., Li X., Lai H.: Degree conditions for group connectivity. Discerete Math. 310, 1050–1058 (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
X. Li was partially supported by Hubei Key Laboratory of Mathematical Sciences of China.
Rights and permissions
About this article
Cite this article
Yang, F., Li, X. Group Connectivity in 3-Edge-Connected Graphs. Graphs and Combinatorics 28, 743–750 (2012). https://doi.org/10.1007/s00373-011-1067-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-011-1067-5