Advertisement

Polynomial graph-colorings

  • Wolfgang Gutjahr
  • Emo Welzl
  • Gerhart Woeginger
Contributed Papers Structures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 349)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BHM]
    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. [G]
    W.Gutjahr, Färbung durch gerichtete Graphen, Diplomarbeit (1988), Institutes for Information Processing, IIG, Technical University of Graz, in preparation.Google Scholar
  3. [GJ]
    M.R. Garey and D.S. Johnson, “Computers and Intractability”, Freeman, N.Y. (1979)Google Scholar
  4. [HN]
    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. [J]
    D.S. Johnson, The NP-completeness column: An ongoing guide, J. Algorithms 3 (1982) 88–99.Google Scholar
  6. [MSaWo]
    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. [MSuWe]
    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. [N]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Wolfgang Gutjahr
    • 1
  • Emo Welzl
    • 2
  • Gerhart Woeginger
    • 2
  1. 1.Institutes for Information Processing, TU GrazGrazAustria
  2. 2.Department of MathematicsFree University of BerlinBerlin 33

Personalised recommendations