𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nowhere-zero 3-flows of graphs with prescribed sizes of odd edge cuts

✍ Scribed by Luo, Rong; Miao, Zhengke; Xu, Rui; Zhang, Cun-Quan

Book ID
122859807
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
389 KB
Volume
36
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

The size of graphs without nowhere-zero
The size of graphs without nowhere-zero 4-flows
✍ Hong-Jian Lai πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 428 KB πŸ‘ 1 views

Let G be a 2-edge-connected simple graph with order n. We show that if IV(G)l 5 17, then either G has a nowhere-zero 4-flow, or G is contractible to the Petersen graph. We also show that for n large, if I€(G)J L (' 2 17) + 34, then either G has a nonwhere-zero 4-flow, or G can be contracted to the P