1 |
G. Liu and J. Wang, (a,b,k)-critical graphs, Adv. Math. (China) 27 (1998), no. 6, 536-540
|
2 |
S. Z. Zhou, Sufficient conditions for (a,b,k)-critical graphs, J. Jilin Univ. Sci. 43 (2005), no. 5, 607-609
|
3 |
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier Publishing Co., Inc., New York, 1976
|
4 |
M. Cai, O. Favaron, and H. Li, (2,k)-factor-critical graphs and toughness, Graphs Combin. 15 (1999), no. 2, 137-142
DOI
|
5 |
H. Enomoto and M. Hagita, Toughness and the existence of k-factors. IV, Discrete Math. 216 (2000), no. 1-3, 111-120
DOI
ScienceOn
|
6 |
Q. Yu, Characterizations of various matching extensions in graphs, Australas. J. Combin. 7 (1993), 55-64
|
7 |
D. R. Woodall, The binding number of a graph and its Anderson number, J. Combinatorial Theory Ser. B 15 (1973), 225-255
DOI
|
8 |
M. Shi, X. Yuan, M. Cai, and O. Favaron, (3,k)-factor-critical graphs and toughness, Graphs Combin. 15 (1999), no. 4, 463-471
DOI
|