Title of article
A note about shortest cycle covers
Author/Authors
Jinlong Shu، نويسنده , , Cun-Quan Zhang، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
7
From page
232
To page
238
Abstract
Let G be a graph with odd edge-connectivity r. It is proved in this paper that if image, then G has a 3-cycle image-cover of total length at most image.
Keywords
Shortest cycle cover , r-graph , Odd-edge connectivity , Cycle cover
Journal title
Discrete Mathematics
Serial Year
2005
Journal title
Discrete Mathematics
Record number
948252
Link To Document