𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Flows, flow-pair covers and cycle double covers

✍ Scribed by Dezheng Xie; Cun-Quan Zhang

Book ID
108114053
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
433 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Nowhere-zero 4-flows and cycle double co
Nowhere-zero 4-flows and cycle double covers
✍ Cun-Quan Zhang πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 572 KB

In this paper, we obtained some necessary and sufficient conditions for a graph having 5, 6and 7-cycle double covers, etc. We also provide a few necessary and sufficient conditions for a graph admitting a nowhere-zero 4-flow. With the aid of those basic properties of nowhere-zero 4flow and the resul

Integer flows and cycle covers
Integer flows and cycle covers
✍ Genghua Fan πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 561 KB
Double cycle covers and the petersen gra
Double cycle covers and the petersen graph
✍ Paul A. Catlin πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 711 KB

Let O(G) denote the set of odd-degree vertices of a graph G. Let t E N and let 9, denote the family of graphs G whose edge set has a partition This partition is associated with a double cycle cover of G. We show that if a graph G is at most 5 edges short of being 4-edge-connected, then exactly one

Minimum cycle coverings and integer flow
Minimum cycle coverings and integer flows
✍ Cun-Quan Zhang πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 421 KB

## Abstract It was conjectured by Fan that if a graph __G__ = (__V,E__) has a nowhere‐zero 3‐flow, then __G__ can be covered by two even subgraphs of total size at most |__V__| + |__E__| ‐ 3. This conjecture is proved in this paper. It is also proved in this paper that the optimum solution of the C