On the strong circular 5‐flow conjecture |
| |
| Authors: | Edita M
ajov Andr Raspaud |
| |
| Institution: | Edita Má?ajová,André Raspaud |
| |
| Abstract: | The Strong Circular 5‐flow Conjecture of Mohar claims that each snark—with the sole exception of the Petersen graph—has circular flow number smaller than 5. We disprove this conjecture by constructing an infinite family of cyclically 4‐edge connected snarks whose circular flow number equals 5. © 2006 Wiley Periodicals, Inc. J Graph Theory |
| |
| Keywords: | flows on graphs circular flow number Mohar's conjecture |
|
