A generalization of 0-sum flows in graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(8)- The complexity of the zero-sum 3-flows
- Nonabelian flows in networks
- Group connectivity for \(K^{-k}_{m, n}\)
- A note on integral generalized flows in directed partial 2-trees
- Zero-sum flows for triple systems
- On zero-sum 6-flows of graphs
- Zero-sum flows of the linear lattice.
- On 1-sum flows in undirected graphs
This page was built for publication: A generalization of 0-sum flows in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947123)