ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Discrete Mathematics
Volume 306, Issue 1, 28 January 2006, Pages 26-30
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (169 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.disc.2005.10.019    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2005 Elsevier B.V. All rights reserved.

Nowhere-zero Z3-flows through Z3-connectivity

Matt DeVosa, E-mail The Corresponding Author, Rui Xub, Corresponding Author Contact Information, E-mail The Corresponding Author and Gexin Yuc, E-mail The Corresponding Author

aDepartment of Mathematics, Princeton University, Princeton, NJ 08544, USA bDepartment of Mathematics, University of West Georgia, Carrollton, GA 30118, USA cDepartment of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA

Received 2 September 2005; 
revised 14 October 2005; 
accepted 21 October 2005. 
Available online 27 December 2005.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

Let Γ be an abelian group. Jaeger et al. [Group connectivity of graphs—a nonhomogeneous analogue of nowhere-zero flow properties, J. Combin. Theory Ser. B 56 (1992) 165–182] introduced a class of graphs which they call Γ-connected. The main interest in Γ-connected graphs is that every Γ-connected graph admits a nowhere-zero Γ-flow. In this paper, we found some families of Z3-connected graphs. Our results generalize an early theorem by Lai (Nowhere-zero 3-flows in locally connected graphs, J. Graph Theory 42 (2003) 211–219) for nowhere-zero Z3-flows in locally connected graphs, and provide a simplified proof of a theorem of Xu and Zhang on nowhere-zero Z3-flows in squares of graphs.

Keywords: Integer flow; Group connectivity; Squares of graphs

Article Outline

1. Introduction
2. Proofs
Further Reading
References

Discrete Mathematics
Volume 306, Issue 1, 28 January 2006, Pages 26-30
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.