Skip to main content
Springer Nature Link
Log in

Polynomial graph-colorings

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 89 (STACS 1989)

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

Included in the following conference series:

  • 160 Accesses

Abstract

For directed graphs G and H, we say that G is H-colorable, if there is a graph homomorphism from G into H; that is, there is a mapping f from the vertex set of G into the vertex set of H such that whenever there is an edge (x, y) in G, then (f(x), f(y)) is an edge in H. We introduce a new technique for proving that the H-coloring problem is polynomial time decidable for some fixed graphs H. Among others, this is the case if H is a semipath (a “path” with edges directed in either direction), which has not been known before. We also show the existence of a tree T, for which the T-coloring problem is NP-complete.

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. J.Bang-Jensen, P.Hell and G.MacGillivray, The complexity of colorings by semicomplete digraphs, SIAM Journal of Discrete Mathematics, 1988 to appear.

    Google Scholar 

  2. W.Gutjahr, Färbung durch gerichtete Graphen, Diplomarbeit (1988), Institutes for Information Processing, IIG, Technical University of Graz, in preparation.

    Google Scholar 

  3. M.R. Garey and D.S. Johnson, “Computers and Intractability”, Freeman, N.Y. (1979)

    Google Scholar 

  4. P.Hell and J.Nešetřil, On the complexity of H-coloring, SFU Computing Science Tech report TR 86-4, to appear in J. Combinatorial Theorie, series B.

    Google Scholar 

  5. D.S. Johnson, The NP-completeness column: An ongoing guide, J. Algorithms 3 (1982) 88–99.

    Google Scholar 

  6. H.A. Maurer, A. Salomaa and D. Wood, Colorings and interpretations: A connection between graphs and grammar forms, Discrete Appl. Math. 3 (1981) 119–135.

    Google Scholar 

  7. H.A. Maurer, J.H. Sudborough and E. Welzl, On the complexity of the general coloring problem, Inform. and Control 51 (1981) 123–145.

    Google Scholar 

  8. J. Nešetřil, Representation of graphs by means of products and their complexity, MFCS 1981, Lecture Notes in Comp. Sci. 118, 94–102.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institutes for Information Processing, TU Graz, Schiesstattgasse 4a, A-8010, Graz, Austria

    Wolfgang Gutjahr

  2. Department of Mathematics, Free University of Berlin, Arnimallee 2–6, D-1000, Berlin 33

    Emo Welzl & Gerhart Woeginger

Authors
  1. Wolfgang Gutjahr
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Emo Welzl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerhart Woeginger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Monien R. Cori

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gutjahr, W., Welzl, E., Woeginger, G. (1989). Polynomial graph-colorings. In: Monien, B., Cori, R. (eds) STACS 89. STACS 1989. Lecture Notes in Computer Science, vol 349. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028977

Download citation

  • DOI: https://doi.org/10.1007/BFb0028977

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50840-3

  • Online ISBN: 978-3-540-46098-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics