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
## 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
## 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