Nearly nowhere-zero \(r\)-flow graphs

DOI10.1016/j.disc.2012.05.016zbMath1248.05081OpenAlexW2046846866MaRDI QIDQ449109

Eckhard Steffen

Publication date: 12 September 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.05.016

zbMATH Keywords

circular flowsnowhere-zero flowsflow conjectures of Tutte, Jaeger and Seymour

Mathematics Subject Classification ID

Flows in graphs (05C21)

Related Items (3)

Nowhere-zero 5-flows ⋮ Measures of edge-uncolorability of cubic graphs ⋮ The Set of Circular Flow Numbers of Regular Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 6-flows
• High-girth graphs avoiding a minor are nearly bipartite
• The circular flow number of a 6-edge connected graph is less than four
• Circular flows of nearly Eulerian graphs and vertex-splitting
• Balanced Valuations and Flows in Multigraphs
• On (k,d)-colorings and fractional nowhere-zero flows
• Circular chromatic number of subgraphs
• On the algebraic theory of graph colorings
• A Contribution to the Theory of Chromatic Polynomials
• Tutte's 5-flow conjecture for highly cyclically connected cubic graphs

This page was built for publication: Nearly nowhere-zero \(r\)-flow graphs