Unions of perfect matchings in r-graphs

DOI10.1016/J.DISC.2023.113550zbMATH Open1518.05150OpenAlexW4381236283MaRDI QIDQ6172292FDOQ6172292

Authors: 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

Recommendations

• scientific article
• Covering a cubic graph by 5 perfect matchings
• A class of cubic graphs satisfying Berge conjecture
• Covering a cubic graph with perfect matchings
• Perfect matching covers of cubic graphs of oddness 2

zbMATH Keywords

perfect matchingscubic graphsBerge-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

• The Factorization of Linear Graphs
• Maximum matching and a polyhedron with 0,1-vertices
• The equivalence of two conjectures of Berge and Fulkerson
• Blocking and anti-blocking pairs of polyhedra
• On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
• Title not available (Why is that?)
• Covering a cubic graph with perfect matchings
• An Upper Bound for the Excessive Index of an r‐Graph
• Unions of 1-factors in \(r\)-graphs and overfull graphs

Cited In (2)

• Pairwise Disjoint Perfect Matchings in r-Edge-Connected r-Regular Graphs
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6172292)