On the strong circular 5‐flow conjecture

DOI10.1002/jgt.20162zbMath1098.05031OpenAlexW4245544202WikidataQ123120317 ScholiaQ123120317MaRDI QIDQ5486281

Edita Máčajová, Andre Raspaud

Publication date: 6 September 2006

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20162

zbMATH Keywords

circular flow numberflows on graphsMohar's conjecture

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Flow number and circular flow number of signed cubic graphs ⋮ Unnamed Item ⋮ A unified approach to construct snarks with circular flow number 5 ⋮ Cubic graphs with colouring defect 3 ⋮ Some snarks are worse than others ⋮ Rotationally symmetric snarks from voltage graphs ⋮ Superposition of snarks revisited ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Treelike snarks ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Snarks with given real flow numbers ⋮ Computational results and new bounds for the circular flow number of snarks

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item
• Unnamed Item

This page was built for publication: On the strong circular 5‐flow conjecture