Integer Flows and Cycle Covers of Graphs available in Hardcover
- Pub. Date:
- Taylor & Francis
Focuses on classical problems in graph theory, including the 5-flow conjectures, the edge-3-colouring conjecture, the 3-flow conjecture and the cycle double cover conjecture. The text highlights the interrelationships between graph colouring, integer flow, cycle covers and graph minors. It also concentrates on graph theoretical methods and results.
|Publisher:||Taylor & Francis|
|Series:||Chapman & Hall/CRC Pure and Applied Mathematics Series , #205|
|Edition description:||New Edition|
|Product dimensions:||7.00(w) x 10.00(h) x 0.75(d)|
Table of Contents
Introduction to integer flows; basic properties of integer flows; nowhere-zero 4-flows; nowhere-zero 3-flows; nowhere-zero k-flows; faithful cycle covers; cycle double covers; shortest cycle covers; generalization and unification; compatible decompositions. Appendices: fundamental theories; hints for exercises; terminology.