1 paper
Tingyan Ma, Ligong Wang
Let G=(V(G),E(G)) be a graph with vertex set V(G) and edge set E(G). A graph is ID-factor-critical if for every independent set I of G whose size has the same parity a…