Inductive $k$-independent graphs and $c$-colorable subgraphs in scheduling: A review

Matthias Bentert, René van Bevern, Rolf Niedermeier

Inductive $k$-independent graphs generalize chordal graphs and have recently been advocated in the context of interference-avoiding wireless communication scheduling. The NP-hard p…