𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Nowhere-zero flows in Cartesian bundles of graphs

✍ Scribed by Edita Rollová; Martin Škoviera

Book ID
113582409
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
196 KB
Volume
33
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Nowhere-zero flows in low genus graphs
Nowhere-zero flows in low genus graphs
✍ Martina Möller; Hans Georg Carstens; Gunnar Brinkmann 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 274 KB 👁 1 views
Nowhere-zero flows in tensor product of
Nowhere-zero flows in tensor product of graphs
✍ Zhao Zhang; Yirong Zheng; Aygul Mamut 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB 👁 1 views

## Abstract In this paper, we characterize graphs whose tensor product admit nowhere‐zero 3‐flow. The main result is: For two graphs __G__~1~ and __G__~2~ with δ ≥ 2 and __G__~2~ not belonging to a well‐characterized class of graphs, the tensor product of __G__~1~ and __G__~2~ admits a nowhere‐zero

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