Title of article
Tutteʹs 5-flow conjecture for highly cyclically connected cubic graphs
Author/Authors
Steffen، نويسنده , , Eckhard، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2007
Pages
4
From page
239
To page
242
Abstract
We prove that every bridgeless cubic graph G which has no edge cut with fewer than 5 2 ω − 1 edges that separates two odd cycles of a minimum 2-factor of G has a nowhere-zero 5-flow. This implies that every cubic graph with cyclic connectivity n G ∗ ⩾ 5 2 ω − 1 has a nowhere-zero 5-flow.
Keywords
cyclic connectivity , Snarks , 5-Flow Conjecture , flows , cubic graphs , Oddness
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2007
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454577
Link To Document