✦ LIBER ✦

Integer flows and cycle covers

✍ Scribed by Genghua Fan

Book ID: 107884338
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 561 KB
Volume: 54
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90069-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Flows, flow-pair covers and cycle double

Flows, flow-pair covers and cycle double covers

✍ Dezheng Xie; Cun-Quan Zhang 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 433 KB

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

Short cycle covers of graphs and nowhere

Short cycle covers of graphs and nowhere-zero flows

✍ Edita Máčajová; André Raspaud; Michael Tarsi; Xuding Zhu 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 1 views

Integer flows

✍ D. H. Younger 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 404 KB

A k-flow is an assignment of edge directions and integer weights in the range 1, ..., k -1 to the edges of an undirected graph so that at each vertex the flow in is equal to the flow out. This paper gives a polynomial algorithm for finding a 6-flow that applies uniformly to each graph. The algorithm

Postman tours and cycle covers

✍ André Raspaud 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 509 KB

Raspaud, A., Postman tours and cycle covers, Discrete Mathematics 111 (1993) 447-454. Let G be a bridgeless graph. We show that the length of a shortest postman tour is at most IF(G)1 + 1 k'(G)1 -3 and that, if G is a minimally 2-edge connected graph, then the length is at most 21 V(G)l-2. We then