A theorem about elementary cuts and flow polynomials

DOI10.1007/S00373-002-0516-6zbMath1023.05049OpenAlexW2077228484MaRDI QIDQ1411114

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

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

Related Items (1)

Tension-flow polynomials on graphs

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