A class of cubic graphs satisfying Berge conjecture
type: Item
instance of: scholarly article
title: A class of cubic graphs satisfying Berge conjecture
zbMATH Open document ID: 1489.05119
author: Wuyang Sun
author: F. Wang
published in: Graphs and Combinatorics
publication date: 2022-03-21T00:00:00Z
review text: In this paper, the authors study the more general result of the Berge conjecture. They show that this conjecture holds for every bridgeless cubic graph containing two perfect matchings with at most one common edge. They provide several lemmas and a main theorem.
reviewed by: Thanin Sitthiwirattham
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7493907
zbMATH Keywords: Berge conjecture
zbMATH Keywords: cubic graph
zbMATH Keywords: covering
zbMATH Keywords: perfect matching
MaRDI profile type: Publication
full work available at URL: s00373-022-02466-2
OpenAlex ID: W4220964362
Wikidata QID: Q113905207
cites work: Treelike snarks
cites work: On cubic bridgeless graphs whose edge-set cannot be covered by four perfect matchings
cites work: Blocking and anti-blocking pairs of polyhedra
cites work: On Fulkerson conjecture
cites work: The equivalence of two conjectures of Berge and Fulkerson
cites work: On Perfect Matching Coverings and Even Subgraph Coverings
cites work: A note on Berge-Fulkerson coloring
cites work: Q5286666
cites work: Fulkerson's conjecture and Loupekine snarks
cites work: 1‐Factor and Cycle Covers of Cubic Graphs
cites work: Covering a cubic graph by 5 perfect matchings
cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
cites work: The Factorization of Linear Graphs
DOI: 10.1007/S00373-022-02466-2
description: scientific article; zbMATH DE number 7493907