Nowhere-zero 3-flows of highly connected graphs

DOI10.1016/0012-365X(92)90706-LMaRDI QIDQ1208358zbMATH OpenFDO

Authors Hong-Jian Lai, Cun-Quan Zhang

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)

Cites work

• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• scientific article; zbMATH DE number 4187837 (Why is no real title available?)
• Bounds of the number of disjoint spanning trees
• Edge-Disjoint Spanning Trees of Finite Graphs
• Flows and generalized coloring theorems in graphs
• Graph theory
• Grötzsch's theorem on 3-colorings
• Integer flows
• On the Problem of Decomposing a Graph into n Connected Factors

Cited in

(24)

• Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
• Nowhere-zero \(k\)-flows of supergraphs
• Nowhere-zero 3-flows in semistrong product of graphs
• Nowhere-zero flows in Cartesian bundles of graphs
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Nowhere-zero 3-flows in abelian Cayley graphs
• Nowhere-zero 4-flows and cycle double covers
• Flows and parity subgraphs of graphs with large odd-edge-connectivity
• Nowhere-zero 3-flows and \(Z_3\)-connectivity in bipartite graphs
• Group connectivity and group colorings of graphs --- a survey
• On mod \((2p+1)\)-orientations of graphs
• Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows
• Modular orientations of random and quasi-random regular graphs
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Nowhere-zero 3-flows in triangularly connected graphs
• Group connectivity in line graphs
• Exponentially many nowhere-zero \(\mathbb{Z}_3\)-, \(\mathbb{Z}_4\)-, and \(\mathbb{Z}_6\)-flows
• Nearly nowhere-zero \(r\)-flow graphs
• EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED
• The complexity of the zero-sum 3-flows
• Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts
• Nowhere-zero 3-flow of graphs with small independence number
• Nowhere-zero 3-flows of graphs with independence number two
• Superposition and constructions of graphs without nowhere-zero \(k\)-flows

This page was built for publication: Nowhere-zero 3-flows of highly connected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208358)