Premium
On the strong circular 5‐flow conjecture
Author(s) -
Máčajová Edita,
Raspaud André
Publication year - 2006
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20162
Subject(s) - conjecture , mathematics , combinatorics , petersen graph , cubic graph , graph , flow (mathematics) , discrete mathematics , geometry , line graph , voltage graph
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