Notes on factor-critically, extendability and independence number

In this paper, we give a sufficient and necessary condition fora k-extendable graph to be 2k-factor-critical when k = �/4, and prove some results on independence numbers in n-factor-critical graphs and

[1]  Lou Caccetta,et al.  A note on k-extendable graphs and independence number , 1995, Australas. J Comb..

[2]  Lutz Volkmann,et al.  Independence number in n-extendable graphs , 1996, Discret. Math..

[3]  Odile Favaron.  Extendability and factor-criticality , 2000, Discret. Math..

[4]  Dingjun Lou,et al.  Connectivity of k-extendable graphs with large k , 2004, Discret. Appl. Math..

[5]  Michael D. Plummer,et al.  On n-extendable graphs , 1980, Discret. Math..

[6]  Dingjun Lou,et al.  Equivalence between Extendability and Factor-Criticality , 2007, Ars Comb..

[7]  Odile Favaron,et al.  On k-factor-critical graphs , 1996, Discuss. Math. Graph Theory.

[8]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[9]  Qinglin Yu,et al.  Characterizations of various matching extensions in graphs , 1993, Australas. J Comb..