Graph Decomposition is NP-Complete: A Complete Proof of Holyer s Conjecture

Dorit Dor, Michael Tarsi. Graph Decomposition is NP-Complete: A Complete Proof of Holyer s Conjecture. SIAM Journal on Computing, 26(4):1166-1187, 1997.

Abstract

Abstract is missing.