Integer flows and cycle covers


Results related to integer flows and cycle covers are presented. A cycle cover of a graph G is a collection %Y of cycles of G which covers all edges of G; U is called a cycle m-cover of G if each edge of G is covered exactly m times by the members of V. By using Seymour’s nowhere-zero 6-flow theorem, we prove that every bridgeless graph has a cycle 6-cover… (More)
DOI: 10.1016/0095-8956(92)90069-A


  • Presentations referencing similar topics