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
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
Journal title :
European Journal of Combinatorics
