Publication at Faculty of Mathematics and Physics, Central Library of Charles University |
2005
Abstract
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.