Zero-Sum Flow Numbers of Regular Graphs

DOI10.1007/978-3-642-29700-7_25zbMath1304.05066OpenAlexW2177116063MaRDI QIDQ2898002

Shih-Wei Hu, Tao-Ming Wang

Publication date: 16 July 2012

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29700-7_25

Mathematics Subject Classification ID

Flows in graphs (05C21)

Related Items (6)

0-sum and 1-sum flows in regular graphs ⋮ On the algorithmic complexity of zero-sum edge-coloring ⋮ The complexity of the zero-sum 3-flows ⋮ Zero-sum flow number of octagonal grid and generalized prism ⋮ Zero-sum flows for triple systems ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications

This page was built for publication: Zero-Sum Flow Numbers of Regular Graphs