✦ LIBER ✦

Short cycle covers of graphs and nowhere-zero flows

✍ Scribed by Edita Máčajová; André Raspaud; Michael Tarsi; Xuding Zhu

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 109 KB
Volume: 68
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20563

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

Short cycle covers of cubic graphs

✍ Genghua Fan 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB

## Abstract Let __G__ be a bridgeless cubic graph. We prove that the edges of __G__ can be covered by circuits whose total length is at most (44/27) |__E(G)__|, and if Tutte's 3‐flow Conjecture is true, at most (92/57) |__E(G)__|.

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

Superposition and Constructions of Graph

Superposition and Constructions of Graphs Without Nowhere-zero k-flows

✍ Martin Kochol 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 492 KB

Using multi-terminal networks we build methods on constructing graphs without nowhere-zero group-and integer-valued flows. In this way we unify known constructions of snarks (nontrivial cubic graphs without edge-3-colorings, or equivalently, without nowhere-zero 4-flows) and provide new ones in the