Minimum Cycle Covering and Integer Flows

Download or read book Minimum Cycle Covering and Integer Flows written by and published by . This book was released on 1989 with total page 14 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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 Chinese Postman problem and the solution of minimum cycle covering problem are equivalent for any graph admitting a nowhere-zero 4-flow.