TY - GEN

T1 - Graph decomposition is NPC - A complete proof of Holyer's conjecture

AU - Dor, Dorit

AU - Tarsi, Michael

N1 - Publisher Copyright:
© 1992 ACM.

PY - 1992/7/1

Y1 - 1992/7/1

N2 - An H-decomposition of a graph G = (V,E) is a partition of E into subgraphs isomorphic to H. Given a fixed graph H, the H-decomposition problem is to determine whether an input graph G admits an H-decomposition I. Holyer (1980) conjectured that H"-decomposition is NP-complete whenever H is connected and has at least 3 edges. Some partial results have been obtained during the last decade. A complete proof for Holyer's conjecture is the content of this paper.

AB - An H-decomposition of a graph G = (V,E) is a partition of E into subgraphs isomorphic to H. Given a fixed graph H, the H-decomposition problem is to determine whether an input graph G admits an H-decomposition I. Holyer (1980) conjectured that H"-decomposition is NP-complete whenever H is connected and has at least 3 edges. Some partial results have been obtained during the last decade. A complete proof for Holyer's conjecture is the content of this paper.

UR - http://www.scopus.com/inward/record.url?scp=0027004049&partnerID=8YFLogxK

U2 - 10.1145/129712.129737

DO - 10.1145/129712.129737

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0027004049

T3 - Proceedings of the Annual ACM Symposium on Theory of Computing

SP - 252

EP - 263

BT - Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992

PB - Association for Computing Machinery

Y2 - 4 May 1992 through 6 May 1992

ER -