Abstract
The 3-flow conjecture of Tutte is that every bridgeless graph without a 3-edge cut has a nowhere-zero 3-flow. We show that it suffices to prove this conjecture for 5-edge-connected graphs. © 2001 Academic Press.
Author supplied keywords
Cite
CITATION STYLE
APA
Kochol, M. (2001). An equivalent version of the 3-flow conjecture. Journal of Combinatorial Theory. Series B, 83(2), 258–261. https://doi.org/10.1006/jctb.2001.2054
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free