Z\(_3\)-CONNECTED GRAPHS WITH NEIGHBORHOOD UNIONS AND MINIMUM DEGREE CONDITION
Keywords:
neighborhood unions, minimum degree, Z\(_3\)-connectivity, 3-flowAbstract
Let G be a 2-edge-connected simple graph on n ≥ 15 vertices, and let A denote an abelian group with the identity element 0. If a graph G* is obtained by repeatedly contracting nontrivial A-connected subgraphs of G until no such a subgraph left, we say G can be A-reduced to G*. In this paper, we prove that if for every uv ∉ E(G), |N(u) ∪ N(v)| + δ(G) ≥ n, then G is not Z3-connected if and only if G can be Z3-reduced to one of {C3, K4, K\(_{4}^{-}\), L}, where L is obtained from K4 by adding a new vertex which is joined to two vertices of K4. Our results extend the early theorem by Li et al. (Graphs and Combin., 29 (2013): 1891-1898).
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2019 Liangchen Li, Fan Yang

This work is licensed under a Creative Commons Attribution 4.0 International License.
L'opera è pubblicata sotto Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

