paper

On disjoint matchings in cubic graphs

arXiv:0803.0134 · doi:10.1016/j.disc.2010.02.007

Abstract

For and a cubic graph let denote the maximum number of edges that can be covered by matchings. We show that and . Moreover, it turns out that .

arXiv comment41 pages, 8 figures, minor chages

References in corpus (4)

Cited by in corpus (5)