A note on a conjecture on maximum matching in almost regular graphs

DOI10.1016/j.disc.2010.09.003zbMath1200.05181OpenAlexW2013728191WikidataQ122873207 ScholiaQ122873207MaRDI QIDQ607026

Christophe Picouleau

Publication date: 19 November 2010

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

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

zbMATH Keywords

bipartite graphmatchingregular graph

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• On disjoint matchings in cubic graphs

This page was built for publication: A note on a conjecture on maximum matching in almost regular graphs