Factor-Critical Graphs with Given Number of Maximum Matchings |
| |
| Authors: | Yan Liu Guiying Yan |
| |
| Institution: | (1) School of Mathematics, South China Normal University, Guangzhou, 510631, P.R. China;(2) Academy of Mathematics and Systems Science, Chinese Academy of Science, Beijing, 100080, P.R. China |
| |
| Abstract: | A connected graph G is said to be factor-critical if G − ν has a perfect matching for every vertex ν of G. In this paper, the factor-critical graphs G with |V(G)| maximum matchings and with |V(G)| + 1 ones are characterized, respectively. From this, some special bicritical graphs are characterized.
This work is supported by the Ph.D. Programs Foundation of Ministry of Education of China (No.20070574006) and the NNSF(10201019)
of China. |
| |
| Keywords: | Maximum matching factor-critical graph bicritical graph |
| 本文献已被 SpringerLink 等数据库收录！ |
|
