Title of article
Unions of perfect matchings in cubic graphs
Author/Authors
Kaiser، نويسنده , , Tom?? and Kr?lʹ، نويسنده , , Daniel and Norine، نويسنده , , Serguei، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
5
From page
341
To page
345
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
cubic graphs , Berge-Fulkersonיs conjecture , Perfect matchings
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2005
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454175
Link To Document