%0 Journal Article
%T On disjoint matchings in cubic graphs
%A Vahan V. Mkrtchyan
%A Samvel S. Petrosyan
%A Gagik N. Vardanyan
%J Computer Science
%D 2008
%I arXiv
%R 10.1016/j.disc.2010.02.007
%X For $i=2,3$ and a cubic graph $G$ let $\nu_{i}(G)$ denote the maximum number of edges that can be covered by $i$ matchings. We show that $\nu_{2}(G)\geq {4/5}| V(G)| $ and $\nu_{3}(G)\geq {7/6}| V(G)| $. Moreover, it turns out that $\nu_{2}(G)\leq \frac{|V(G)|+2\nu_{3}(G)}{4}$.
%U http://arxiv.org/abs/0803.0134v4