Skip to main content
SpringerLink
Log in

Towards a solution of the Holyer's problem

  • Conference paper
  • First Online:
Book cover Graph-Theoretic Concepts in Computer Science (WG 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 790))

Included in the following conference series:

  • 158 Accesses

Abstract

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 P H 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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Alon: A note on the decomposition of graphs into isomorphic matchings, Acta Math. Acad. Sci. Hung. 42 (1983), 221–223

    Google Scholar 

  2. J.C. Bermond, D. Sotteau: Graph decomposition and G-designs, Proc. of the 5th British combinatorial conference, Aberdeen 1975

    Google Scholar 

  3. A. Bialostocki, Y. Roditty: 3K2-decomposition of a graph, Acta Math. Acad. Sci. Hung. 40 (1982), 201–208

    Google Scholar 

  4. J. Bosak: Graph Decompositions, Springer-Verlag 1990

    Google Scholar 

  5. A.E. Brouwer, R.M. Wilson: The decomposition of graphs into ladder graphs, Stiching Mathematisch Centrum (zn 97/80), Amsterdam 1980

    Google Scholar 

  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–124

    Google Scholar 

  7. E. Cohen, M. Tarsi: NP-completeness of graph decomposition problem, Journal of Complexity 7 (1991), 200–212

    Google Scholar 

  8. D. Dor, M. Tarsi: Graph decomposition is NPC — A complete proof of Holyer's conjecture, 1992, preprint

    Google Scholar 

  9. O. Favaron, Z. Lonc, M. Truszczyński: Decomposition of graphs into graphs with three edges, Ars Combinatoria 20 (1985), 125–146

    Google Scholar 

  10. P. Hell, D.G. Kirkpatrick: On the complexity of general graph factor problems, SIAM Journal of Computing 12(1983), 601–609

    Google Scholar 

  11. I. Holyer: The NP-completeness of some edge partition problems, SIAM J. of Comp. 10 (1981), 713–717

    Google Scholar 

  12. Masuyama, Hakimi: Edge packing in graphs, preprint

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics, Warsaw University of Technology, 00-661, Warsaw, Poland

    Zbigniew Lonc

Authors
  1. Zbigniew Lonc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lonc, Z. (1994). Towards a solution of the Holyer's problem. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-57899-4_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57899-4

  • Online ISBN: 978-3-540-48385-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation