On the complexity of H-coloring
- 1 February 1990
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 48 (1), 92-110
- https://doi.org/10.1016/0095-8956(90)90132-j
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- On unavoidable digraphs in orientations of graphsJournal of Graph Theory, 1987
- Improving the performance guarantee for approximate graph coloringJournal of the ACM, 1983
- NP-completeness of a family of graph-colouring problemsDiscrete Applied Mathematics, 1983
- On minimal graphsTheoretical Computer Science, 1982
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Colorings and interpretations: a connection between graphs and grammar formsDiscrete Applied Mathematics, 1981
- Cohomomorphisms of graphs and hypergraphsMathematische Nachrichten, 1979
- An application of graph coloring to printed circuit testingIEEE Transactions on Circuits and Systems, 1976
- The Complexity of Near-Optimal Graph ColoringJournal of the ACM, 1976
- Symmetric relations (undirected graphs) with given semigroupsMonatshefte für Mathematik, 1965