𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nowhere-zero 3-flows of highly connected graphs

✍ Scribed by Hong-Jian Lai; Cun-Quan Zhang

Book ID
103061019
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
302 KB
Volume
110
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Nowhere-zero 3-flows in locally connecte
Nowhere-zero 3-flows in locally connected graphs
✍ Hong-Jian Lai πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 91 KB πŸ‘ 1 views

## Abstract Let __G__ be a graph. For each vertex __v__ ∈__V__(__G__), __N~v~__ denotes the subgraph induces by the vertices adjacent to __v__ in __G__. The graph __G__ is locally __k__‐edge‐connected if for each vertex __v__ ∈__V__(__G__), __N~v~__ is __k__‐edge‐connected. In this paper we study t

Nowhere-zero 3-flows in products of grap
Nowhere-zero 3-flows in products of graphs
✍ Jinlong Shu; Cun-Quan Zhang πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 104 KB

## Abstract A graph __G__ is an odd‐circuit tree if every block of __G__ is an odd length circuit. It is proved in this paper that the product of every pair of graphs __G__ and __H__ admits a nowhere‐zero 3‐flow unless __G__ is an odd‐circuit tree and __H__ has a bridge. This theorem is a partial r

Nowhere-Zero Flows in Random Graphs
Nowhere-Zero Flows in Random Graphs
✍ Benny Sudakov πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 138 KB

A nowhere-zero 3-flow in a graph G is an assignment of a direction and a value of 1 or 2 to each edge of G such that, for each vertex v in G, the sum of the values of the edges with tail v equals the sum of the values of the edges with head v. Motivated by results about the region coloring of planar

Nearly nowhere-zero -flow graphs
Nearly nowhere-zero -flow graphs
✍ Eckhard Steffen πŸ“‚ Article πŸ“… 2012 πŸ› Elsevier Science 🌐 English βš– 204 KB