Decomposition formulas for the flow polynomial

DOI10.1016/J.EJC.2004.05.004MaRDI QIDQ2567283zbMATH OpenOpenAlexFDO

Authors 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

abelian groupedge cutminor

Mathematics Subject Classification ID

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

Review text

The flow polynomial \(F_X(k)\) of a reflexive multigraph \(X\) (loops and multiple edges are allowed) evaluates the number of nowhere-zero \(G\)-flows in \(X\) for any abelian group \(G\) of order \(k\). Let \(C\) be an edge cut of the reflexive multigraph \(X\) such that \(X-C\) has precisely two components \(X_1\) and \(X_2\). The author gives a formula for the flow polynomial of \(X\) in terms of flow polynomials of bridgeless minors of \(X\) whose edge sets are equal to one of \(C\), \(X_1\cup C\), or \(X_2\cup C\).

Recommendations

• Decomposition of the flow polynomial
• A theorem about elementary cuts and flow polynomials
• Polynomials associated with nowhere-zero flows
• A note on flow polynomials of graphs
• Bounds for the coefficients of flow polynomials

Cites work

• A Class Of Abelian Groups
• A Contribution to the Theory of Chromatic Polynomials
• Decomposition of the flow polynomial
• scientific article; zbMATH DE number 3882430 (Why is no real title available?)
• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
• Superposition and constructions of graphs without nowhere-zero k-flows

Cited in

(7)

• A note on flow polynomials of graphs
• Decomposition of the flow polynomial
• Matrix reduction in a combinatorial computation
• Linear algebraic approach to an edge-coloring result
• Edge cut splitting formulas for Tutte-Grothendieck invariants
• Counting flows of b-compatible graphs
• Smallest counterexample to the 5-flow conjecture has girth at least eleven

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567283)