| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514579 | Electronic Notes in Discrete Mathematics | 2005 | 5 Pages |
Abstract
We show that any cubic bridgeless graph with m edges contains two perfect matchings that cover at least 3m/5 and three perfect matchings that cover at least 27m/35 of its edges.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
TomáÅ¡ Kaiser, Daniel Král', Serguei Norine,