Degree Conditions of Fractional ID-k-Factor-Critical Graphs
Bulletin of the Malaysian Mathematical Society, Tome 33 (2010) no. 3
Cet article a éte moissonné depuis la source Bulletin of the Malaysian Mathematical Society website
We say that a simple graph G is fractional independent-set-deletable k -factor-critical, shortly, fractional ID- k -factor-critical, if G-I has a fractional k -factor for every independent set I of G . Some sufficient conditions for a graph to be fractional ID- k -factor-critical are studied in this paper. Furthermore, we show that the result is best possible in some sense.
Classification :
05C70.
@article{BMMS_2010_33_3_a0,
author = {Renying Chang and Guizhen Liu and Yan Zhu},
title = {Degree {Conditions} of {Fractional} {ID-k-Factor-Critical} {Graphs}},
journal = {Bulletin of the Malaysian Mathematical Society},
year = {2010},
volume = {33},
number = {3},
url = {http://geodesic.mathdoc.fr/item/BMMS_2010_33_3_a0/}
}
Renying Chang; Guizhen Liu; Yan Zhu. Degree Conditions of Fractional ID-k-Factor-Critical Graphs. Bulletin of the Malaysian Mathematical Society, Tome 33 (2010) no. 3. http://geodesic.mathdoc.fr/item/BMMS_2010_33_3_a0/