Title of article
A bound on the total size of a cut cover
Author/Authors
André Kündgen، نويسنده , , Megan Spangler، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
8
From page
121
To page
128
Abstract
A cycle cover (cut cover) of a graph G is a collection of cycles (cuts) of G that covers every edge of G at least once. The total size of a cycle cover (cut cover) is the sum of the number of edges of the cycles (cuts) in the cover.
We discuss several results for cycle covers and the corresponding res
Keywords
Cut , Cycle , Edge cover
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948457
Link To Document