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

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 252-263

  Dor, Dorit ^a   Tarsi, Michael ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; ONLINE SYSTEMS; THEOREM PROVING;

DECOMPOSITION PROBLEMS; FIXED GRAPHS; GRAPH DECOMPOSITIONS; GRAPH G; INPUT GRAPHS; NP COMPLETE; PARTIAL RESULTS; SUBGRAPHS;

GRAPH THEORY;

GRAPH DECOMPOSITION; HOLYER'S CONJECTURE;

EID: 0027004049     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129737     Document Type: Conference Paper

References (15)

1. N. Alon, "A note on the decomposition of graphs into isomorphic matchings.," Acta Math. Hung.42 (1983), 221-223.
2. J.C. Bermond & D. Sotteau, "Graph decomposition! and G-designs.," Proc. of the 5th British combinatorial conference., Aberdeen (1975).
3. A. Bialostocki & Y. Roditty, " K-decomposition of a graph," Acta math. Acad. Sci. Hungar. 40 (1982), 201-208.
4. A. E. Brouwer & R. M. Wilson, The decomposition of graphs into ladder graphs, Stiching mathematisch centrum (zn 97/80), Amsterdam, 1980.
5. Y. Caro, Decomposition and Partition of trees into isomorphic subtrees., Tel-Aviv University (M.Sc Thesis), 1985.
6. E. Cohen k M. Tarsi, "NP-Completeness of Graph-Decomposition Problems," Journal of Complexity 7 (1991), 200-212.
7. O. Favaron, Z. Lone & M. Truszczynski, "Decomposition of graphs into graphs with three edges," Ars Combinatoria20(1985), 125-146.
8. M. R. Garey & D. S. Johnson, Computers and Intractability, a guide to the theory ofNP-completeness, W. H. Freeman and Company, San Francisco, 1979.
9. Ian Holyer, The complexity of graph theory problems., Churchill College (Ph.D dissertation)., Cambridge, 1980.
10. Ian Holyer, "The NP-completeness of some edge partition problems.," Siam J. of comp. 10 (1981), 713-717.
11. D, G. Kirkpatrick & P. Hell, On the completeness of a generalized matching problem, 10th annual ACM Symposium on Theory of Computing Machinery, New-York, 1978.
12. Masuyama κ. Hakimi, "Edge packing in graphs," preprint.
13. M. Preisler & M. Tarsi, "On the decomposition of graphs into copies of PaUV Ars Combinatoria (To appear).
14. J. Steiner, "Combinatorische aufgäbe.," Z. Reine Angew Math45 (1853), 181-182.
15. R.M. Wilson, "Decomposition of a complete graph into subgraphs isomorphic to a given graph.," Militas Math, Winnipeg (1976).