Covering a cubic graph by 5 perfect matchings
Combinatorics
2016-03-01 v2
Abstract
Berge Conjecture states that every bridgeless cubic graph has 5 perfect matchings such that each edge is contained in at least one of them. In this paper, we show that Berge Conjecture holds for two classes of cubic graphs, cubic graphs with a circuit missing only one vertex and bridgeless cubic graphs with a 2-factor consisting of two circuits. The first part of this result implies that Berge Conjecture holds for hypohamiltonian cubic graphs.
Cite
@article{arxiv.1601.03248,
title = {Covering a cubic graph by 5 perfect matchings},
author = {Wuyang Sun},
journal= {arXiv preprint arXiv:1601.03248},
year = {2016}
}
Comments
12 pages