{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:55:31Z","timestamp":1720054531513},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"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":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0012-365x(96)00223-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"145-154","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["The complexity of restricted graph homomorphisms"],"prefix":"10.1016","volume":"167-168","author":[{"given":"Richard C.","family":"Brewster","sequence":"first","affiliation":[]},{"given":"Pavol","family":"Hell","sequence":"additional","affiliation":[]},{"given":"Gary","family":"MacGillivray","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00223-3_BIB1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0401029","article-title":"The complexity of colouring by semicomplete digraphs","volume":"1","author":"Bang-Jensen","year":"1988","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00223-3_BIB2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0012-365X(94)00189-P","article-title":"Hereditarily hard H-colouring problems","volume":"138","author":"Bang-Jensen","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00223-3_BIB3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1006\/jctb.1994.1040","article-title":"The complexity of infinite H-colouring","volume":"61","author":"Bauslaugh","year":"1994","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00223-3_BIB4","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(96)00223-3_BIB5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0020-0190(91)90171-D","article-title":"A note on restricted H-colourings","volume":"40","author":"Brewster","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0012-365X(96)00223-3_BIB6","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1137\/0402044","article-title":"Pair labelings with given distance","volume":"2","author":"Furedi","year":"1989","journal-title":"SIAM J. on Discrete Math."},{"key":"10.1016\/S0012-365X(96)00223-3_BIB7","doi-asserted-by":"crossref","first-page":"71","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\/S0012-365X(96)00223-3_BIB8","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","article-title":"On the complexity of H-colouring","volume":"48","author":"Hell","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00223-3_BIB9","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0012-365X(92)90282-K","article-title":"The core of a graph","volume":"109","author":"Hell","year":"1992","journal-title":"Discrete math."},{"key":"10.1016\/S0012-365X(96)00223-3_BIB10","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1137\/S0895480192239992","article-title":"The existence of homomorphisms to oriented cycles","volume":"8","author":"Hell","year":"1995","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00223-3_BIB11","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0404035","article-title":"On the complexity of colourings by vertex-transitive and arc-transitive digraphs","volume":"4","author":"MacGillivray","year":"1991","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00223-3_BIB12","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\/S0012-365X(96)00223-3_BIB13","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.4153\/CJM-1968-151-x","article-title":"The categorical products of graphs","volume":"20","author":"Miller","year":"1968","journal-title":"Canad. J. Math."},{"key":"10.1016\/S0012-365X(96)00223-3_BIB14","first-page":"94","article-title":"Representations of graphs by means of products and their complexity","author":"Ne\u0161et\u0159il","year":"1982","journal-title":"Math. Found. of Comput. Sci."},{"key":"10.1016\/S0012-365X(96)00223-3_BIB15","article-title":"Properties of circulant graphs","volume":"3","author":"Turner","year":"1967","journal-title":"J. Combin. Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002233?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96002233?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:47Z","timestamp":1556130467000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96002233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":15,"alternative-id":["S0012365X96002233"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00223-3","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}