A theorem about elementary cuts and flow polynomials

DOI10.1007/S00373-002-0516-6MaRDI QIDQ1411114zbMATH OpenOpenAlexFDO

Authors Martin Kochol

Publication date 16 October 2003

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-002-0516-6

zbMATH Keywords

totally cyclic orientationedge-cutintegral flows

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Polynomials associated with nowhere-zero flows
• Nowhere-zero \(\vec{k}\)-flows on graphs
• The number of nowhere-zero flows on graphs and signed graphs
• Decomposition of the flow polynomial
• Tension-flow polynomials on graphs

Cited in

(2)

• Tension-flow polynomials on graphs
• Decomposition formulas for the flow polynomial

This page was built for publication: A theorem about elementary cuts and flow polynomials

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