| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4654336 | European Journal of Combinatorics | 2009 | 7 Pages |
Abstract
We prove that every line graph of a 4-edge-connected graph is Z3-connected. In particular, every line graph of a 4-edge-connected graph has a nowhere zero 3-flow.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hong-Jian Lai, Lianying Miao, Yehong Shao,