Decomposition formulas for the flow polynomial

DOI10.1016/j.ejc.2004.05.004zbMath1076.05080OpenAlexW2015254016MaRDI QIDQ2567283

Martin Kochol

Publication date: 29 September 2005

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2004.05.004

zbMATH Keywords

minorabelian groupedge cut

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph theory (05C99)

Related Items (4)

Edge cut splitting formulas for Tutte-Grothendieck invariants ⋮ Matrix reduction in a combinatorial computation ⋮ Linear algebraic approach to an edge-coloring result ⋮ Smallest counterexample to the 5-flow conjecture has girth at least eleven

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition of the flow polynomial
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows
• A Class Of Abelian Groups
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Decomposition formulas for the flow polynomial