On the strong circular 5‐flow conjecture
- 19 May 2006
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 52 (4) , 307-316
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 TheoryKeywords
This publication has 11 references indexed in Scilit:
- Construction of graphs with given circular flow numbersJournal of Graph Theory, 2003
- Superposition and Constructions of Graphs Without Nowhere-zero k-flowsEuropean Journal of Combinatorics, 2002
- Circular chromatic numberDiscrete Mathematics, 2001
- Circular flow numbers of regular multigraphsJournal of Graph Theory, 2001
- On (k,d)-colorings and fractional nowhere-zero flowsJournal of Graph Theory, 1998
- On Tutte's extension of the four-colour problemJournal of Combinatorial Theory, Series B, 1981
- Flows and generalized coloring theorems in graphsJournal of Combinatorial Theory, Series B, 1979
- Balanced Valuations and Flows in MultigraphsProceedings of the American Mathematical Society, 1976
- A theorem on three-coloring the edges of a trivalent graphJournal of Combinatorial Theory, 1967
- A Contribution to the Theory of Chromatic PolynomialsCanadian Journal of Mathematics, 1954