Covering a cubic graph with perfect matchings
From MaRDI portal
Publication:393450
DOI10.1016/j.disc.2013.06.006zbMath1281.05110arXiv1111.1871OpenAlexW1999389412MaRDI QIDQ393450
Publication date: 23 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.1871
Related Items
Perfect matching covering, the Berge-Fulkerson conjecture, and the Fan-Raspaud conjecture, Unions of perfect matchings in \(r\)-graphs, Odd 2-factored snarks, Perfect matching covers of cubic graphs of oddness 2, An equivalent formulation of the Fan-Raspaud Conjecture and related problems, Measures of edge-uncolorability of cubic graphs
Cites Work
- Unnamed Item
- On snarks that are far from being 3-edge colorable
- Fano colourings of cubic graphs and the Fulkerson conjecture
- Perfect matchings with restricted intersection in cubic graphs
- On parsimonious edge-colouring of graphs with maximum degree three
- Covering cubic graphs with matchings of large size
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
- The equivalence of two conjectures of Berge and Fulkerson
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- An Upper Bound for the Excessive Index of an r‐Graph
- Maximum matching and a polyhedron with 0,1-vertices
- Blocking and anti-blocking pairs of polyhedra
