✦ LIBER ✦

Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4

✍ Scribed by Jackson, Bill

Book ID: 118176839
Publisher: Society for Industrial and Applied Mathematics
Year: 1990
Tongue: English
Weight: 945 KB
Volume: 19
Category: Article
ISSN: 0097-5397
DOI: 10.1137/0219044

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.