Unions of perfect matchings in \(r\)-graphs

DOI10.1016/j.disc.2023.113550zbMath1518.05150OpenAlexW4381236283MaRDI QIDQ6172292

Unnamed Author, Guantao Chen

Publication date: 19 July 2023

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113550

zbMATH Keywords

cubic graphsperfect matchingsBerge-Fulkerson conjecture\(r\)-graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Covering a cubic graph with perfect matchings
• Unions of 1-factors in \(r\)-graphs and overfull graphs
• 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
• The Factorization of Linear Graphs

This page was built for publication: Unions of perfect matchings in \(r\)-graphs