Publikace na Matematicko-fyzikální fakulta, Ústřední knihovna |
2005
Abstrakt
We show that every cubic bridgeless graph contains two perfect matching covering at least 3/5 of its edges (the bound is the best possible) and discuss unions of three perfect matchings.