{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T09:04:39Z","timestamp":1775639079274,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8567,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1016\/0095-8956(90)90132-j","type":"journal-article","created":{"date-parts":[[2004,12,22]],"date-time":"2004-12-22T01:35:48Z","timestamp":1103679348000},"page":"92-110","source":"Crossref","is-referenced-by-count":508,"title":["On the complexity of H-coloring"],"prefix":"10.1016","volume":"48","author":[{"given":"Pavol","family":"Hell","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslav","family":"Ne\u0161et\u0159il","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(90)90132-J_BIB1","first-page":"19","article-title":"Homomorphisms of 3-chromatic graphs, II","volume":"47","author":"Albertson","year":"1985"},{"key":"10.1016\/0095-8956(90)90132-J_BIB2","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1002\/jgt.3190110402","article-title":"On unavoidable digraphs in orientations of graphs","volume":"11","author":"Bloom","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/0095-8956(90)90132-J_BIB3","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(82)90135-9","article-title":"On minimal graphs","volume":"17","author":"Fellner","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0095-8956(90)90132-J_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","article-title":"The complexity of near-optimal graph coloring","volume":"23","author":"Garey","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0095-8956(90)90132-J_BIB5","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","article-title":"An application of graph coloring to printed circuit testing","volume":"Cas 23","author":"Garey","year":"1976","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0095-8956(90)90132-J_BIB6","author":"Garey","year":"1979"},{"key":"10.1016\/0095-8956(90)90132-J_BIB7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF02122553","article-title":"On multiplicative graphs, and the product conjecture","volume":"8","author":"H\u00e4ggkvist","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0095-8956(90)90132-J_BIB8","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BF01297617","article-title":"Symmetric relations (undirected graphs) with given semigroups","volume":"69","author":"Hedrl\u00edn","year":"1965","journal-title":"Monatsh. Math."},{"key":"10.1016\/0095-8956(90)90132-J_BIB9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0095-8956(74)90040-9","article-title":"Absolute planar retracts and the four-color conjecture","volume":"17","author":"Hell","year":"1974","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/0095-8956(90)90132-J_BIB10","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/mana.19790870107","article-title":"Cohomomorphisms of graphs and hypergraphs","volume":"87","author":"Hell","year":"1979","journal-title":"Math. Nachr."},{"key":"10.1016\/0095-8956(90)90132-J_BIB11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0166-218X(83)90020-3","article-title":"NP-completeness of a family of graph-colouring problems","volume":"5","author":"Irving","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0095-8956(90)90132-J_BIB12","series-title":"Proceedings 5th Southeastern Conference on Combinatorics, Graph Theory, and Computing","first-page":"513","article-title":"Worst case behaviour of graph coloring algorithms","author":"Johnson","year":"1974"},{"key":"10.1016\/0095-8956(90)90132-J_BIB13","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0196-6774(82)90011-6","article-title":"The NP-completeness column: An ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0095-8956(90)90132-J_BIB14","doi-asserted-by":"crossref","first-page":"348","DOI":"10.21136\/CPM.1984.118204","article-title":"Some new good characterizations of directed graphs","volume":"51","author":"Kom\u00e1rek","year":"1984","journal-title":"Casopis P\u011bst. Mat."},{"key":"10.1016\/0095-8956(90)90132-J_BIB15","first-page":"265","article-title":"Universal sequential search problems","volume":"9","author":"Levin","year":"1973","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0095-8956(90)90132-J_BIB16","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","article-title":"A graph coloring algorithm for large scheduling problems","volume":"84","author":"Leighton","year":"1979","journal-title":"J. Res. Nat. Bur. Standards"},{"key":"10.1016\/0095-8956(90)90132-J_BIB17","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0166-218X(81)90037-8","article-title":"Colorings and interpretations: A connection between graphs and grammar forms","volume":"3","author":"Maurer","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0095-8956(90)90132-J_BIB18","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(81)90226-6","article-title":"On the complexity of the general coloring problem","volume":"51","author":"Maurer","year":"1981","journal-title":"Inform. and Control"},{"key":"10.1016\/0095-8956(90)90132-J_BIB19","first-page":"94","article-title":"Representations of graphs by means of products and their complexity","author":"Ne\u0161et\u0159il","year":"1982","journal-title":"MFCS"},{"key":"10.1016\/0095-8956(90)90132-J_BIB20","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0012-365X(78)90062-6","article-title":"On classes of relations and graphs determined by subobjects and factorobjects","volume":"22","author":"Ne\u0161et\u0159il","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0095-8956(90)90132-J_BIB21","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1145\/2157.2158","article-title":"Improving the performance guarantee for approximate graph coloring","volume":"30","author":"W gderson","year":"1983","journal-title":"J. Assoc. Comput. Math."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090132J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090132J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,2]],"date-time":"2021-07-02T01:14:19Z","timestamp":1625188459000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569090132J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["009589569090132J"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(90)90132-j","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}