On maximum matchings in 5-regular and 6-regular multigraphs

DOI10.1016/J.DISC.2022.113243zbMATH Open1504.05226OpenAlexW4308478465MaRDI QIDQ2099481FDOQ2099481

Authors Sevak Abrahamyan 

Publication date 23 November 2022

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphmaximum matchingregular multigraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Maximum matchings in regular graphs
• On maximum matchings in almost regular graphs
• A note on a conjecture on maximum matching in almost regular graphs
• Maximum matchings in a regular graph of specified connectivity and bounded order
• Maximum matchings in regular graphs of high girth

Cites work

• scientific article; zbMATH DE number 3220175 (Why is no real title available?)
• A note on a conjecture on maximum matching in almost regular graphs
• Matching theory
• Maximum matchings in regular graphs
• On disjoint matchings in cubic graphs
• On maximum matchings in almost regular graphs
• Paths, Trees, and Flowers

Cited in

(4)

• A note on a conjecture on maximum matching in almost regular graphs
• Maximum matchings in regular graphs
• On maximum matchings in almost regular graphs
• More on the sixth coefficient of the matching polynomial in regular graphs

This page was built for publication: On maximum matchings in 5-regular and 6-regular multigraphs

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