Extending a partial nowhere-zero 4-flow
From MaRDI portal
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cites work
Cited in
(14)- Group connectivity in 3-edge-connected graphs
- The Chvátal-Erdős condition for group connectivity in graphs
- Eulerian subgraphs and \(S\)-connectivity of graphs
- Group connectivity and matchings
- Group connectivity and group colorings of graphs --- a survey
- Spanning triangle-trees and flows of graphs
- Group connectivity of complementary graphs
- Extendability of contractible configurations for nowhere-zero flows and modulo orientations
- Group connectivity under 3‐edge‐connectivity
- On Density of \(\boldsymbol{\mathbb{Z}_3}\) -Flow-Critical Graphs
- On the 4-flow nullity of graphs
- On graphs whose \(\mathbb{Z}_4\)-connectivity varies from \(\mathbb{Z}_2^2\)-connectivity
- Group connectivity of graphs with diameter at most 2
- Degree conditions for group connectivity
This page was built for publication: Extending a partial nowhere-zero 4-flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4238042)