On the complexity of H-coloring

[1]  Pavol Hell,et al.  On multiplicative graphs and the product conjecture , 1988, Comb..

[2]  Stefan A. Burr,et al.  On unavoidable digraphs in orientations of graphs , 1987, J. Graph Theory.

[3]  Michael O. Albertson,et al.  Homomorphisms of 3-chromatic graphs , 1985, Discret. Math..

[4]  P. Komarek.  Some new good characterizations for directed graphs , 1984 .

[5]  Avi Wigderson,et al.  Improving the performance guarantee for approximate graph coloring , 1983, JACM.

[6]  Robert W. Irving,et al.  NP-completeness of a family of graph-colouring problems , 1983, Discret. Appl. Math..

[7]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[8]  W. Fellner.  On Minimal Graphs , 1982, Theoretical Computer Science.

[9]  Hermann A. Maurer,et al.  On the Complexity of the General Coloring Problem , 1981, Inf. Control..

[10]  Jaroslav Nesetril.  Representations of Graphs by Means of Products and Their Complexity , 1981, MFCS.

[11]  Derick Wood,et al.  Colorings and interpretations: a connection between graphs and grammar forms , 1981, Discret. Appl. Math..

[12]  Frank Thomson Leighton,et al.  A Graph Coloring Algorithm for Large Scheduling Problems. , 1979, Journal of research of the National Bureau of Standards.

[13]  J. Nesetril,et al.  Cohomomorphisms of graphs and hypergraphs , 1979 .

[14]  Jaroslav Nesetril,et al.  On classes of relations and graphs determined by subobjects and factorobjects , 1978, Discret. Math..

[15]  David S. Johnson,et al.  The Complexity of Near-Optimal Graph Coloring , 1976, J. ACM.

[16]  Michael Randolph Garey,et al.  An Application of Graph Coloring to Printed Circuit Testing (Working Paper) , 1975, FOCS 1975.

[17]  P. Hell.  Absolute planar retracts and the four color conjecture , 1974 .

[18]  Z. Hedrlín,et al.  Symmetric relations (undirected graphs) with given semigroups , 1965 .