Constant sum flows in regular graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(8)- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
- On 1-sum flows in undirected graphs
- Zero-sum flow numbers of regular graphs
- 0-sum and 1-sum flows in regular graphs
- The complexity of the zero-sum 3-flows
- Zero-sum flow number of categorical and strong product of graphs
- Group magicness of certain planar graphs
- Zero-sum flow number of octagonal grid and generalized prism
This page was built for publication: Constant sum flows in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004666)