The clique problem on inductive $k$-independent graphs

George Manoussakis

A graph is inductive $k$-independent if there exists and ordering of its vertices $v_1,...,v_n$ such that $\alpha (G[N(v_i)\cap V_i])\le k$ where $N(v_i)$ is the neighborhood…