|
|||||
|
|
A note on a conjecture on maximum matching in almost regular graphs |
|
| Authors: | C. Picouleau |
| Affiliation: | |
| Abstract: | Mkrtchyan, Petrosyan, and Vardanyan made the following conjecture: Every graph G with Δ(G)−δ(G)≤1 has a maximum matching whose unsaturated vertices do not have a common neighbor. We disprove this conjecture. |
| Keywords: | Bipartite graph Matching Regular graph |
| 本文献已被 ScienceDirect 等数据库收录！ | |