| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4651879 | Electronic Notes in Discrete Mathematics | 2015 | 5 Pages |
Abstract
We prove that every cyclically 6-edge-connected cubic graph with oddness at most 4 has a nowhere-zero 5-flow. Therefore, a possible minimum counterexample to the 5-flow conjecture has oddness at least 6.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
