Zero-sum flows in regular graphs
From MaRDI portal
Recommendations
Cites work
- \(E_{11}\) and M theory
- A Contribution to the Theory of Chromatic Polynomials
- Combinatorial Nullstellensatz
- Flows and generalized coloring theorems in graphs
- Nowhere-zero 6-flows
- Nowhere-zero integral flows on a bidirected graph
- On flows in bidirected graphs
- On Representatives of Subsets
- On zero-sum 6-flows of graphs
Cited in
(28)- On zero-sum 6-flows of graphs
- Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications
- A generalization of 0-sum flows in graphs
- Nowhere-zero unoriented 6-flows on certain triangular graphs
- Some criteria for a signed graph to have full rank
- 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
- Zero-sum flow numbers of regular graphs
- 0-sum and 1-sum flows in regular graphs
- Constant sum flows in regular graphs
- Zero-sum flows in designs
- Zero-sum flow numbers of triangular grids
- Zero-sum magic labelings and null sets of regular graphs
- A note on zero-sum 5-flows in regular graphs
- 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
- Nowhere-zero bases for the nullspace of the incidence matrices of graphs
- A new proof of validity of Bouchet's conjecture on Eulerian bidirected graphs
- Minimum flows in the total graph of a finite commutative ring
- Zero-sum flow number of octagonal grid and generalized prism
- Odd decompositions of Eulerian graphs
- Zero-sum flow numbers of hexagonal grids
- Zero-sum flow numbers of product graphs
- Compatible forts and maximum nullity of a graph
- Zero-sum flows for triple systems
This page was built for publication: Zero-sum flows in regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q605010)
