Integer flows and cycle covers of graphs
By: Cun-Quan Zhang.
Series: Monographs and textbooks in pure and applied mathematics ;; 205
Publisher: Marcel Dekker
Published: 1997
Place of publication: New York
Language: eng
Number of pages: 379
Subjects: Graph theory.
Description: This unique, self-contained reference/text - the first book of its kind devoted to both integer flows and cycle covers - focuses on classical problems in graph theory, including the 5-flow and 4-flow conjectures, the edge-3-coloring conjecture, the 3-flow conjecture, and the cycle double cover conjecture. Concentrating on graph theoretical methods and results, Integer Flows and Cycle Covers of Graphs highlights the interrelationships between graph coloring, integer flow, cycle covers, and graph minors...discusses the fundamental properties and equivalent versions of integer flows...furnishes major, widely known result...describes faithful cycle covers and cycle double covers of graphs...presents applications and generalizations of integer flows, cycle covers, and related topics...provides many different approaches to integer flow problems plus potential approaches to the cycle double cover conjecture...and more. Containing key literature citations and illustrations, Integer Flows and Cycle Covers of Graphs is a practical reference for applied mathematicians, combinatorists, computer scientists, and operations researchers and an invaluable text for graduate-level students taking courses in advanced graph theory.
Notes: Includes bibliographical references (p. 353-371) and index.