Let be a graph on the vertex set . A vertex subset is a cover of if is an independent set of , and is a non-cover of if is not a cover of . The non-cover complex of is a simplicial complex on whose faces are non-covers of . Then the non-cover complex of is the combinatorial Alexander dual of the independence complex of . In this talk, I will show the -collapsibility of the non-cover complex of a graph where denotes the independence domination number of using the minimal exclusion sequence method. This is joint work with Ilkyoo Choi and Boram Park.