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

Dorit Dor; Michael Tarsi

doi:10.1145/129712.129737

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

Dorit Dor, Michael Tarsi

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	English
Title of host publication	Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992
Publisher	Association for Computing Machinery
Pages	252-263
Number of pages	12
ISBN (Electronic)	0897915119
DOIs	https://doi.org/10.1145/129712.129737
State	Published - 1 Jul 1992
Event	24th Annual ACM Symposium on Theory of Computing, STOC 1992 - Victoria, Canada Duration: 4 May 1992 → 6 May 1992

Publication series

Name	Proceedings of the Annual ACM Symposium on Theory of Computing
Volume	Part F129722
ISSN (Print)	0737-8017

Conference

Conference	24th Annual ACM Symposium on Theory of Computing, STOC 1992
Country/Territory	Canada
City	Victoria
Period	4/05/92 → 6/05/92

Access to Document

10.1145/129712.129737

Cite this

@inproceedings{0c6ae02fb4714fb8bcfe9c14cacb90d5,

title = "Graph decomposition is NPC - A complete proof of Holyer's conjecture",

abstract = "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.",

author = "Dorit Dor and Michael Tarsi",

note = "Publisher Copyright: {\textcopyright} 1992 ACM.; null ; Conference date: 04-05-1992 Through 06-05-1992",

year = "1992",

month = jul,

day = "1",

doi = "10.1145/129712.129737",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "252--263",

booktitle = "Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992",

}

Dor, D & Tarsi, M 1992, Graph decomposition is NPC - A complete proof of Holyer's conjecture. in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Proceedings of the Annual ACM Symposium on Theory of Computing, vol. Part F129722, Association for Computing Machinery, pp. 252-263, 24th Annual ACM Symposium on Theory of Computing, STOC 1992, Victoria, Canada, 4/05/92. https://doi.org/10.1145/129712.129737

Graph decomposition is NPC - A complete proof of Holyer's conjecture. / Dor, Dorit; Tarsi, Michael.

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Association for Computing Machinery, 1992. p. 252-263 (Proceedings of the Annual ACM Symposium on Theory of Computing; Vol. Part F129722).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Dor, Dorit

AU - Tarsi, Michael

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 -

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

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this