独立集可削去因子临界图和无爪的独立集可削去因子临界图的度条件

DEGREE CONDITION OF ID-FACTOR-CRITICAL GRAPHS AND CLAW-FREE ID-FACTOR-CRITICAL GRAPHS

研究了不含开邻集是独立集或空集的小团(奇数个顶点)的独立集可削去因子临界图以及无爪的独立集可削去因子临界图的度条件.

A simple graph G is called independent-set-deletable factor-critical,shortly,ID-factor-critical,if G-I has a perfect matching for every independent set I of G which has the same parity with ｜V（G）｜.Degree conditions of ID-factor-critical graphs and connected claw-free ID-factor-critical graphs which do not contain a clique C satisfying that ｜C｜〈（｜V（G）｜/3）,where ｜C｜ is odd and NG（C）=φ or NG（C） is independent,are studied in this paper.