Dorit Dor Michael Tarsi Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture. 1166-1187 1997 26 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp26.html#DorT97