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

SIAM Journal on Computing

Volumn 26, Issue 4, 1997, Pages 1166-1187

  Dor, Dorit ^a   Tarsi, Michael ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Decomposition; Graph; NP completeness

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SET THEORY; THEOREM PROVING;

HOLYER CONJECTURE; POLYNOMIAL TIME ALGORITHM;

GRAPH THEORY;

EID: 0031209110     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539792229507     Document Type: Article

References (18)

1. N. ALON, A note on the decomposition of graphs into isomorphic matchings, Acta Math. Hungar., 42 (1983), pp. 221-223.
2. J. C. BERMOND AND D. SOTTEAU, Graph decomposition and G-designs, in Proc. 5th British Combinatorial Conference, Aberdeen, 1975, Utilitas Math. Publishers, pp. 53-72.
3. 2-decomposition of a graph, Acta Math. Acad. Sci. Hungar., 40 (1982), pp. 201-208.
4. A. E. BROUWER AND R. M. WILSON, The decomposition of graphs into ladder graphs, zn 97/80, Stiching Mathematisch Centrum, Amsterdam, 1980.
5. K. BRYŚ AND Z. LONC, A complete solution of a Holyer problem, in Proc. 4th Twente Workshop on Graph and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 1995.
6. Y. CARO, Decomposition and partition of trees into isomorphic subtrees, M.Sc. thesis, Tel-Aviv University, Tel-Aviv, 1985.
7. O. FAVARON, Z. LONC, AND M. TRUSZCZYNSKI, Decomposition of graphs into graphs with three edges, Ars Combin., 20 (1985), pp. 125-146.
8. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
9. I. HOLYER, The complexity of graph theory problems, Ph.D. dissertation, Churchill College, Cambridge, UK, 1980.
10. I. HOLYER, The NP-completeness of some edge partition problems, SIAM J. Comput., 10 (1981), pp. 713-717.
11. D. G. KIRKPATRICK AND P. HELL, On the completeness of a generalized matching problem, in Proc. 10th Annual ACM Symposium on Theory of Computing Machinery, ACM, New York, 1978, pp. 240-245.
12. 12 is polynomial, J. Combin. Theory B, 69 (1997), pp. 164-182.
13. J. STEINER, Combinatorische aufgabe, Z. Reine Angew. Math., 45 (1853), pp. 181-182.
14. R. M. WILSON, Decomposition of a Complete Graph into Subgraphs Isomorphic to a Given Graph, Utilitas Mathematica Publishing, Winnipeg, MB, 1976, pp. 647-695.
15. 2, Ars Combin., 35 (1993), pp. 325-333.
16. J. BOSKA, Graph Decompositions, Springer-Verlag, Berlin, 1990.
17. E. COHEN AND M. TARSI, NP-completeness of graph-decomposition problems, J. Complexity, 7 (1991), pp. 200-212.
18. S. MASUYAMA AND S. L. HAKIMI, Edge packing in graphs, preprint.