1. Alekseev, V.E.: The effect of local constraints on the complexity of determination of the graph independence number. Comb. Algebr. Methods Appl. Math. 3–13 (1982)
2. Angaleeswari, K., Sumathi, P., Swaminathan, V.: $$k$$-extendability in graphs. Int. J. Pure Appl. Math. 101(5), 801–809 (2015)
3. Angaleeswari, K., Sumathi, P., Swaminathan, V.: Weakly $$k$$-extendable graphs. Int. J. Pure Appl. Math. 109(6), 35–40 (2016)
4. Berge, C.: Some common properties for regularizable graphs, edge-critical graphs and B-graphs. Graph Theory Algorithms Lect. Notes Comput. Sci. 108, 108–123 (1981)
5. Bonnet, É., Bousquet, N., Charbit, P., Thomassé, S., Watrigant, R.: Parameterized complexity of independent set in $$H$$-free graphs. Algorithmica 82(8), 2360–2394 (2020)