On disjoint matchings in cubic graphs

Details On disjoint matchings in cubic graphs On disjoint matchings in cubic graphs

2008-03-02

arxiv.org/abs/0803.0134v4

Discrete Mathematics, 310/10-11 (2010), pp. 1588-1613

Computer Science

Discrete Mathematics

41 pages, 8 figures, minor chages

Scientific paper

10.1016/j.disc.2010.02.007

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}$.

Affiliated with

Also associated with

No associations

Rating

On disjoint matchings in cubic graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On disjoint matchings in cubic graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On disjoint matchings in cubic graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-359784