On the maximum fraction of edges covered by \(t\) perfect matchings in a cubic bridgeless graph
From MaRDI portal
DOI10.1016/j.disc.2015.03.017zbMath1310.05170arXiv1306.2828OpenAlexW2046399465MaRDI QIDQ2342641
Giuseppe Mazzuoccolo, Louis Esperet
Publication date: 29 April 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2828
Related Items
Cites Work
- Fulkerson's conjecture and circuit covers
- Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
- The equivalence of two conjectures of Berge and Fulkerson
- The NP-Completeness of Edge-Coloring
- Blocking and anti-blocking pairs of polyhedra
- Unnamed Item
- Unnamed Item
- Unnamed Item