Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
From MaRDI portal
Publication:442306
DOI10.1016/j.disc.2012.03.028zbMath1246.05092OpenAlexW1992147764MaRDI QIDQ442306
Publication date: 10 August 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2012.03.028
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Connectivity (05C40) Flows in graphs (05C21)
Related Items
An extremal problem on bigraphic pairs with an \(A\)-connected realization, Degree sum of 3 independent vertices and \(Z_3\)-connectivity
Cites Work
- Unnamed Item
- Unnamed Item
- Degree sum condition for \(Z_{3}\)-connectivity in graphs
- Ore-condition and \(Z_3\)-connectivity
- Degree sum and nowhere-zero 3-flows
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Group connectivity of 3-edge-connected chordal graphs
- An equivalent version of the 3-flow conjecture
- Group connectivity and group colorings of graphs --- a survey
- Ore Condition and Nowhere-Zero 3-Flows
- Claw‐decompositions and tutte‐orientations
- On the algebraic theory of graph colorings