Towards a solution of the Holyer's problem

  • Zbigniew Lonc
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 790)


Let H be a fixed graph. We say that a graph G admits an H-decomposition if the set of edges of G can be partitioned into subsets generating graphs isomorphic to H. Denote by PH the problem of exsitence of an H-decomposition of a graph. The Holyer's problem is to classify the problems PH according to their computational complexities. In this paper we outline the proof of polynomiality of the problem PH for H being the union of s disjoint 2-edge paths. This case is believed to bear the main difficulties among so far uncovered cases.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    N. Alon: A note on the decomposition of graphs into isomorphic matchings, Acta Math. Acad. Sci. Hung. 42 (1983), 221–223Google Scholar
  2. 2.
    J.C. Bermond, D. Sotteau: Graph decomposition and G-designs, Proc. of the 5th British combinatorial conference, Aberdeen 1975Google Scholar
  3. 3.
    A. Bialostocki, Y. Roditty: 3K2-decomposition of a graph, Acta Math. Acad. Sci. Hung. 40 (1982), 201–208Google Scholar
  4. 4.
    J. Bosak: Graph Decompositions, Springer-Verlag 1990Google Scholar
  5. 5.
    A.E. Brouwer, R.M. Wilson: The decomposition of graphs into ladder graphs, Stiching Mathematisch Centrum (zn 97/80), Amsterdam 1980Google Scholar
  6. 6.
    F.R.K. Chung, R.L. Graham: Recent results in graph decompositions, In Combinatorics (H.N.V. Temperley, ed.), London Math. Soc., Lecture Notes Series 52 (1981), 103–124Google Scholar
  7. 7.
    E. Cohen, M. Tarsi: NP-completeness of graph decomposition problem, Journal of Complexity 7 (1991), 200–212Google Scholar
  8. 8.
    D. Dor, M. Tarsi: Graph decomposition is NPC — A complete proof of Holyer's conjecture, 1992, preprintGoogle Scholar
  9. 9.
    O. Favaron, Z. Lonc, M. Truszczyński: Decomposition of graphs into graphs with three edges, Ars Combinatoria 20 (1985), 125–146Google Scholar
  10. 10.
    P. Hell, D.G. Kirkpatrick: On the complexity of general graph factor problems, SIAM Journal of Computing 12(1983), 601–609Google Scholar
  11. 11.
    I. Holyer: The NP-completeness of some edge partition problems, SIAM J. of Comp. 10 (1981), 713–717Google Scholar
  12. 12.
    Masuyama, Hakimi: Edge packing in graphs, preprintGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Zbigniew Lonc
    • 1
  1. 1.Institute of MathematicsWarsaw University of TechnologyWarsawPoland

Personalised recommendations