✦ LIBER ✦

Nowhere-Zero 3-Flows of Graphs with Independence Number Two

✍ Scribed by Rong Luo, Zhengke Miao, Rui Xu

Book ID: 120788779
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 224 KB
Volume: 29
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1238-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nowhere-zero 3-flows of highly connected

Nowhere-zero 3-flows of highly connected graphs

✍ Hong-Jian Lai; Cun-Quan Zhang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 302 KB

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

Realizing Degree Sequences with Graphs H

Realizing Degree Sequences with Graphs Having Nowhere-Zero 3-Flows

✍ Luo, Rong; Xu, Rui; Zang, Wenan; Zhang, Cun-Quan 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 266 KB

The size of graphs with clique number m

The size of graphs with clique number m and without nowhere-zero 4-flows

✍ Zhi-Hong Chen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Nowhere-zero 3-flows and -connectivity o

Nowhere-zero 3-flows and -connectivity of a family of graphs

✍ Jin Yan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 294 KB

Cycle covers of graphs with a nowhere-ze

Cycle covers of graphs with a nowhere-zero 4-flow

✍ André Raspaud 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB 👁 1 views

## Abstract It is shown that the edges of a simple graph with a nowhere‐zero 4‐flow can be covered with cycles such that the sum of the lengths of the cycles is at most |__E__(__G__)| + |__V__(__G__)| −3. This solves a conjecture proposed by G. Fan.