References
- J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier Publishing Co., Inc., New York, 1976
- M. Cai, O. Favaron, and H. Li, (2,k)-factor-critical graphs and toughness, Graphs Combin. 15 (1999), no. 2, 137-142 https://doi.org/10.1007/s003730050035
- H. Enomoto and M. Hagita, Toughness and the existence of k-factors. IV, Discrete Math. 216 (2000), no. 1-3, 111-120 https://doi.org/10.1016/S0012-365X(99)00298-8
- G. Liu and J. Wang, (a,b,k)-critical graphs, Adv. Math. (China) 27 (1998), no. 6, 536-540
- M. Shi, X. Yuan, M. Cai, and O. Favaron, (3,k)-factor-critical graphs and toughness, Graphs Combin. 15 (1999), no. 4, 463-471 https://doi.org/10.1007/s003730050053
- D. R. Woodall, The binding number of a graph and its Anderson number, J. Combinatorial Theory Ser. B 15 (1973), 225-255 https://doi.org/10.1016/0095-8956(73)90038-5
- Q. Yu, Characterizations of various matching extensions in graphs, Australas. J. Combin. 7 (1993), 55-64
- S. Z. Zhou, Sufficient conditions for (a,b,k)-critical graphs, J. Jilin Univ. Sci. 43 (2005), no. 5, 607-609
Cited by
- A sufficient condition for a graph to be an (a, b, k)-critical graph vol.87, pp.10, 2010, https://doi.org/10.1080/00207160902777914