𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nowhere-zero 15-flow in 3-edge-connected bidirected graphs

✍ Scribed by Wei, Er Ling; Tang, Wen Liang; Ye, Dong


Book ID
121721295
Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2014
Tongue
English
Weight
477 KB
Volume
30
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Flows in 3-edge-connected bidirected gra
✍ Erling Wei; Wenliang Tang; Xiaofeng Wang πŸ“‚ Article πŸ“… 2011 πŸ› Higher Education Press and Springer 🌐 English βš– 143 KB
Nowhere-zero 3-flows in locally connecte
✍ 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
✍ 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