Nowhere-zero 3-flows of highly connected graphs

DOI10.1016/0012-365X(92)90706-LzbMath0809.05063MaRDI QIDQ1208358

Cun-Quan Zhang, Hong-Jian Lai

Publication date: 16 May 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

nowhere-zero 3-flow\(k\)-edge-connected graph

Mathematics Subject Classification ID

Trees (05C05) Deterministic network models in operations research (90B10) Connectivity (05C40)

Related Items

Nowhere-zero 4-flows and cycle double covers ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Group connectivity in line graphs ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ The complexity of the zero-sum 3-flows ⋮ Modular Orientations of Random and Quasi-Random Regular Graphs ⋮ On mod \((2p+1)\)-orientations of graphs ⋮ EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flows and generalized coloring theorems in graphs
• Bounds of the number of disjoint spanning trees
• Grötzsch's theorem on 3-colorings
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Integer flows