Counting nowhere-zero flows on wheels

DOI10.1016/J.DISC.2007.04.028zbMath1148.05033OpenAlexW2039875788MaRDI QIDQ952677

Martin Kochol, Katarína Šranková, Silvia Smejová, Nad'a Krivoňáková

Publication date: 12 November 2008

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

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

zbMATH Keywords

\(n\)-wheelnowhere-zero \(A\)-flowsimple network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Matrix reduction in a combinatorial computation ⋮ Reductions of Matrices Associated with Nowhere-Zero Flows ⋮ Smallest counterexample to the 5-flow conjecture has girth at least eleven

Cites Work

• Smallest counterexample to the 5-flow conjecture has girth at least eleven
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows
• Restrictions on smallest counterexamples to the 5-flow conjecture
• Reductions of Matrices Associated with Nowhere-Zero Flows
• A Class Of Abelian Groups
• A Contribution to the Theory of Chromatic Polynomials
• Unnamed Item

This page was built for publication: Counting nowhere-zero flows on wheels