Title of article
On disjoint matchings in cubic graphs
Author/Authors
Mkrtchyan، نويسنده , , Vahan V. and Petrosyan، نويسنده , , Samvel S. and Vardanyan، نويسنده , , Gagik N.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
26
From page
1588
To page
1613
Abstract
For i = 2 , 3 and a cubic graph G let ν i ( G ) denote the maximum number of edges that can be covered by i matchings. We show that ν 2 ( G ) ≥ 4 5 | V ( G ) | and ν 3 ( G ) ≥ 7 6 | V ( G ) | . Moreover, it turns out that ν 2 ( G ) ≤ | V ( G ) | + 2 ν 3 ( G ) 4 .
Keywords
Matching , Cubic graph , Pair and triple of matchings
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1598286
Link To Document