A class of cubic graphs satisfying Berge conjecture
From MaRDI portal
Publication:2117532
DOI10.1007/s00373-022-02466-2zbMath1489.05119OpenAlexW4220964362WikidataQ113905207 ScholiaQ113905207MaRDI QIDQ2117532
Publication date: 21 March 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02466-2
Cites Work
- Unnamed Item
- Treelike snarks
- A note on Berge-Fulkerson coloring
- 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: A class of cubic graphs satisfying Berge conjecture