Abstract
A connected graph G is said to be a factor-critical graph if G −v has a perfect matching for every vertex v of G. In this paper, the 2-connected factor-critical graph G which has exactly |E(G)| + 1 maximum matchings is characterized.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R. Graph Theory with Applications. Macmillan Press Ltd, London, 1976
Cyvin, S.J., Gutman, I. Kekulé structures and their symmetry properties. Computers Math. Appl., 12-B(3/4): 859–876 (1986)
Liu, Y., Hao, J. The enumeration of near-perfect matchings of factor-critical graphs. Discrete Math., 2243: 259–266 (2002)
Liu, Y., Zhang, S. Ear Decomposition of Factor-critical Graphs and Number of Maximum Matchings. Bulletin of the Malaysian Mathematical Science Society, 38:1537–1549 (2015)
Lovász, L., Plummer, M.D. Matching Theory, Elsevier Science Publishers. B.V. orth-Holland, Amesterdam, 1985
Pulleyblank, W.R. Faces of Matching polyhedra. Ph.D. Thesis, Dept. Combinatorices and Optimization, Univ. of Waterloo, 1973
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by the National Natural Science Foundation of China (No.11551003), the Scientific research fund of the Science and Technology Program of Guangzhou, China (No.201510010265) and the Qinghai Province Natural Science Foundation (No.2015-ZJ-911).
Rights and permissions
About this article
Cite this article
Li, Mh., Liu, Y. 2-Connected factor-critical graphs G with exactly |E(G)| + 1 maximum matchings. Acta Math. Appl. Sin. Engl. Ser. 33, 1001–1014 (2017). https://doi.org/10.1007/s10255-017-0715-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10255-017-0715-9