Snarks with given real flow numbers

DOI10.1002/jgt.20551zbMath1244.05107OpenAlexW1967814846MaRDI QIDQ3096956

Martin Škoviera, Robert Lukot'ka

Publication date: 15 November 2011

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

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

zbMATH Keywords

nowhere zero flowsnarkflow number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Flows in graphs (05C21)

Related Items

Flow number and circular flow number of signed cubic graphs, A unified approach to construct snarks with circular flow number 5, Circular flow number of Goldberg snarks, Superposition of snarks revisited, Measures of edge-uncolorability of cubic graphs, The Set of Circular Flow Numbers of Regular Graphs, Computational results and new bounds for the circular flow number of snarks

Cites Work

• Flows and generalized coloring theorems in graphs
• On Tutte's extension of the four-colour problem
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Restrictions on smallest counterexamples to the 5-flow conjecture
• Circular flow numbers of regular multigraphs
• On (k,d)-colorings and fractional nowhere-zero flows
• Construction of graphs with given circular flow numbers
• Tutte's 5-flow conjecture for graphs of nonorientable genus 5
• Coloring-flow duality of embedded graphs
• On the strong circular 5‐flow conjecture
• A Contribution to the Theory of Chromatic Polynomials
• Circular chromatic number: A survey