It is said that a graph G is independent-set-deletable factor-critical (in short,ID-factor-critical), if, for every inde......

本文研究ID-因子临界图的度和条件，得到使得图G是ID-因子临界图的任意两个不相邻的顶点的度和的下界，同时说明这些结果是最好可能的......