Skip to main content
Log in

Neighborhood Unions and Z 3-Connectivity in Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

Let G be a 2-edge-connected simple graph on n ≥ 14 vertices, and let A be 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 that G can be A-reduced to G*. In this paper, we prove that if for every \({uv\not\in E(G), |N(u) \cup N(v)| \geq \lceil \frac{2n}{3} \rceil}\), then G is not Z 3-connected if and only if G can be Z 3-reduced to one of \({\{C_3,K_4,K_4^-, L\}}\), where L is obtained from K 4 by adding a new vertex which is joined to two vertices of K 4.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondy J.A., Murty U.S.R.: Graphs Theroy with Applications. Macmillan Press, New York (1976)

    Google Scholar 

  2. Chen J., Eschen E., Lai H.-J.: Group connectivity of certain graphs. Ars Combin. 89, 217–227 (2008)

    MathSciNet  Google Scholar 

  3. Devos M., Xu R., Yu G.: Nowhere-zero Z 3-flows through Z 3-connectivity. Discrete Math. 306, 26–30 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Fan G., Zhou C.: Ore condition and nowhere zero 3-flows. Discrete Math. SIAM J. 22, 288–294 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  5. Fan G., Zhou C.: Degree sum and nowhere zero 3-flows. Discrete Math. 308, 6233–6240 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Faudree R.J., Could R.J., Jacobson M.S., Schelp R.H.: Neighborhood unions and hamiltonian properties in graphs. J Combin. Theory. Ser. B 47, 1–9 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jaeger F., Linial N., Payan C., Tarsi N.: Group connectivity of graphs-a nonhomogeneous analogue of nowhere zero flow properties. J Combin. Theory. Ser. B 56, 165–182 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Lai H.-J., Li X., Shao Y., Zhan M.: Group connectivity and group colorings of graphs-a survey. Acta Math Sinica 27, 405–434 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lai H.-J.: Group connectivity of 3-edge-connected chordal graphs. Graphs Combin. 16, 165–176 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  10. Li X., Lai H.-J., Shao Y.: Degree condition and Z 3-connectivity. Discrete Math. 312, 1658–1669 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  11. Luo R., Xu R., Yin J., Yu G.: Ore condition and Z 3-connectivity. Eur. J Combin. 29, 1587–1595 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Tutte W.T.: A contribution on the theory of chromatic polynomial. Canad. J. Math. 6, 80–91 (1954)

    Article  MathSciNet  MATH  Google Scholar 

  13. Tutte W.T.: On the algebraic theory of graph colorings. J. Combin. Theory 1, 15–50 (1966)

    Article  MathSciNet  MATH  Google Scholar 

  14. Yao X., Li X., Lai H.-J.: Degree conditions for group connectivity. Discrete Math. 310, 1050–1058 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Zhang X., Zhan M., Shao Y., Xu R., Li X., Lai H.J.: Degree sum condition for Z 3-connectivity in graphs. Discrete Math. 310, 3390–3397 (2010)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liangchen Li.

Additional information

Supported by the Natural Science Foundation of China (11171129) and CCNU11A02015.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, L., Li, X. Neighborhood Unions and Z 3-Connectivity in Graphs. Graphs and Combinatorics 29, 1891–1898 (2013). https://doi.org/10.1007/s00373-012-1240-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1240-5

Keywords

Navigation