Every line graph of a 4-edge-connected graph is Z3-connected

Authors:
Hong-Jian Lai;Lianying Miao;Yehong Shao
Affiliations:
Department of Mathematics, West Virginia University, Morgantown, WV 26506, United States;College of Science, China University of Mining and Technology, Xuzhou, Jiangsu, 221008, PR China;Arts and Science, Ohio University Southern, Ironton, OH 45638, United States
Venue:
European Journal of Combinatorics
Year:
2009

Citing 5
Cited 0

Group connectivity of graphs: a nonhomogeneous analogue of nowhere-zero flow properties

Journal of Combinatorial Theory Series B
Nowhere zero flows in line graphs

Discrete Mathematics
An equivalent version of the 3-flow conjecture

Journal of Combinatorial Theory Series B
Graph Theory With Applications

Graph Theory With Applications
Nowhere-zero 3-flows in locally connected graphs

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that every line graph of a 4-edge-connected graph is Z"3-connected. In particular, every line graph of a 4-edge-connected graph has a nowhere zero 3-flow.