Perfect matching covers of cubic graphs of oddness 2
From MaRDI portal
Publication:1732040
zbMath1409.05164MaRDI QIDQ1732040
Publication date: 15 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v26i1p42
Cites Work
- Unnamed Item
- Covering a cubic graph with perfect matchings
- Sparsely intersecting perfect matchings in cubic graphs
- Treelike snarks
- A note on Berge-Fulkerson coloring
- Fulkerson's conjecture and circuit covers
- Double covers of cubic graphs with oddness 4
- Five cycle double covers of some cubic graphs
- Covering a cubic graph by 5 perfect matchings
- Fulkerson's conjecture and Loupekine snarks
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings
- On Fulkerson conjecture
- The equivalence of two conjectures of Berge and Fulkerson
- On Perfect Matching Coverings and Even Subgraph Coverings
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- 1‐Factor and Cycle Covers of Cubic Graphs
- Blocking and anti-blocking pairs of polyhedra
- The Factorization of Linear Graphs
This page was built for publication: Perfect matching covers of cubic graphs of oddness 2