Zero-sum flow numbers of regular graphs
From MaRDI portal
Publication:2898002
DOI10.1007/978-3-642-29700-7_25zbMATH Open1304.05066OpenAlexW2177116063MaRDI QIDQ2898002FDOQ2898002
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
Recommendations
Cited In (18)
- The complexity of the zero-sum 3-flows
- 0-sum and 1-sum flows in regular graphs
- The Set of Circular Flow Numbers of Regular Graphs
- Zero-sum flow number of categorical and strong product of graphs
- Zero-sum flows in regular graphs
- On the algorithmic complexity of zero-sum edge-coloring
- Zero-sum flows for triple systems
- Zero-sum flow number of octagonal grid and generalized prism
- On zero-sum 6-flows of graphs
- Constant sum flows in regular graphs
- Zero-sum flows of the linear lattice.
- Zero-sum flow numbers of product graphs
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
- On 1-sum flows in undirected graphs
- Zero-sum 6-flows in 5-regular graphs
- Circular zero-sum \(r\)-flows of regular graphs
- Zero-sum flow numbers of triangular grids
- Zero-sum flow numbers of hexagonal grids
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)
