Funder
National Natural Science Foundation of China (CN)
Fundamental Research Funds for the Central Universities
Natural Sciences and Engineering Research Council of Canada
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference13 articles.
1. Berge, C.: Sur le couplaage maximum d’un graphe. C. R. Acad. Sci. Paris 247, 258–259 (1958)
2. Bollobás, B., Riordan, O., Ryjác̆ek, Z., Saito, A., Schelp, R.H.: Closure and hamiltonian-connectivity of claw-free graphs. Discrete Math. 195, 67–80 (1999)
3. Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111–136 (1976)
4. Favaron, O.: On $$k$$ k -factor-critical graphs. Discuss. Math. Graph Theory 16, 41–51 (1996)
5. Jin, Z., Yan, H., Yu, Q.: Generalization of matching extensions in graphs (II). Discrete Appl. Math. 155, 1267–1274 (2007)