Title of article
Shortest Circuit Covers of Cubic Graphs
Author/Authors
Jackson، نويسنده , , B.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1994
Pages
9
From page
299
To page
307
Abstract
We show that the edge set of a bridgeless cubic graph G can be covered with circuits such that the sum of the lengths of the circuits is at most 6439|E(G)|. Stronger results are obtained for cubic graphs of large girth.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1994
Journal title
Journal of Combinatorial Theory Series B
Record number
1525856
Link To Document