Covering a cubic graph by 5 perfect matchings
From MaRDI portal
Publication:2397531
DOI10.1016/J.DISC.2017.03.014zbMATH Open1362.05107arXiv1601.03248OpenAlexW2964236189MaRDI QIDQ2397531FDOQ2397531
Authors: Wuyang Sun 
Publication date: 22 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1601.03248
Recommendations
Cites Work
- The Factorization of Linear Graphs
- The equivalence of two conjectures of Berge and Fulkerson
- Blocking and anti-blocking pairs of polyhedra
- Title not available (Why is that?)
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- A note on Berge-Fulkerson coloring
- On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
- On Fulkerson conjecture
- On perfect matching coverings and even subgraph coverings
- Fulkerson's conjecture and Loupekine snarks
- 1-factor and cycle covers of cubic graphs
- Treelike snarks
- Fulkerson-covers of hypohamiltonian graphs
Cited In (6)
This page was built for publication: Covering a cubic graph by 5 perfect matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397531)
