Zero-sum flow numbers of regular graphs

DOI10.1007/978-3-642-29700-7_25MaRDI QIDQ2898002zbMATH OpenOpenAlexFDO

Authors Tao-Ming Wang, Shih-Wei Hu

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)

Recommendations

• Zero-sum flows in regular graphs
• Zero-sum 6-flows in 5-regular graphs
• Constant sum flows in regular graphs
• A note on zero-sum 5-flows in regular graphs
• Circular zero-sum r-flows of regular graphs

Cited in

(18)

• On zero-sum 6-flows of graphs
• Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
• Circular zero-sum r-flows of regular graphs
• Zero-sum 6-flows in 5-regular graphs
• On the algorithmic complexity of zero-sum edge-coloring
• On 1-sum flows in undirected graphs
• 0-sum and 1-sum flows in regular graphs
• Constant sum flows in regular graphs
• Zero-sum flow numbers of triangular grids
• Zero-sum flows of the linear lattice.
• The complexity of the zero-sum 3-flows
• Zero-sum flow number of categorical and strong product of graphs
• Zero-sum flow number of octagonal grid and generalized prism
• Zero-sum flow numbers of hexagonal grids
• The Set of Circular Flow Numbers of Regular Graphs
• Zero-sum flows in regular graphs
• Zero-sum flow numbers of product graphs
• Zero-sum flows for triple systems

This page was built for publication: Zero-sum flow numbers of regular graphs

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