1. Alekseev, V.: The effect of local constraints on the complexity of determination of the graph independence number. Combin.-Algebraic 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. Lecture Notes in Computer Science;M de Berg,2010
5. 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)