Matchings in regular graphs |
| |
| Authors: | D. Naddef W.R. Pulleyblank |
| |
| Affiliation: | I.R.M.A., Université Scientifique et Médicale de Grenoble, France;Department of Computer science, The University of Calgary, Canada |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
