On maximum matchings in almost regular graphs

DOI10.1016/j.disc.2013.11.019zbMath1281.05112arXiv1202.0681OpenAlexW2075731869MaRDI QIDQ394310

Petros A. Petrosyan

Publication date: 27 January 2014

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

Full work available at URL: https://arxiv.org/abs/1202.0681

zbMATH Keywords

bipartite graphmaximum matchingregular graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

On extension of regular graphs ⋮ Corrigendum to: ``On disjoint matchings in cubic graphs ⋮ Maximum matchings in regular graphs ⋮ On maximum matchings in 5-regular and 6-regular multigraphs

Cites Work

• A note on a conjecture on maximum matching in almost regular graphs
• On disjoint matchings in cubic graphs
• Matching theory
• The Factorization of Linear Graphs

This page was built for publication: On maximum matchings in almost regular graphs