Title of article
Every line graph of a 4-edge-connected graph is -connected
Author/Authors
Lai، نويسنده , , Hong-Jian and Miao، نويسنده , , Lianying and Shao، نويسنده , , Yehong، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
7
From page
595
To page
601
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.
Journal title
European Journal of Combinatorics
Serial Year
2009
Journal title
European Journal of Combinatorics
Record number
1547135
Link To Document