Abstract

We consider k-regular graphs with specified edge connectivity and show how some classical theorems and some new results concerning the existence of matchings in such graphs can be proved by using the polyhedral characterization of Edmonds. In addition, we show that lower bounds of Lovász and Plummer on the number of perfect matchings in bicritical graphs can be improved for cubic bicritical graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call