Tight bound for matching

DOI10.1007/s10878-010-9299-5zbMath1244.90193OpenAlexW2024051903MaRDI QIDQ431927

Yijie Han

Publication date: 3 July 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9299-5

zbMATH Keywords

matchingcombinatorial problemslower boundgraph algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Lower bounds on the cardinality of the maximum matchings of planar graphs
• A constructive proof of Vizing's theorem
• Tight bounds on maximal and maximum matchings
• Matching for Graphs of Bounded Degree
• The Factorization of Linear Graphs

This page was built for publication: Tight bound for matching