Title of article :
Small cycle cover of 2-connected cubic graphs
Author/Authors :
Hongjian Lai، نويسنده , , Xiangwen Li، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2003
Abstract :
Every 2-connected simple cubic graph of order n⩾6 has a cycle cover with at most ⌈n/4⌉ cycles. This bound is best possible.
Keywords :
Cycle cover , Cubic graphs
Journal title :
Discrete Mathematics
Journal title :
Discrete Mathematics
