{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:59:55Z","timestamp":1648904395033},"reference-count":13,"publisher":"Elsevier BV","issue":"15","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"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":2542,"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":[[2006,8]]},"DOI":"10.1016\/j.disc.2006.03.036","type":"journal-article","created":{"date-parts":[[2006,6,15]],"date-time":"2006-06-15T08:46:02Z","timestamp":1150361162000},"page":"1758-1764","source":"Crossref","is-referenced-by-count":4,"title":["Building blocks for the variety of absolute retracts"],"prefix":"10.1016","volume":"306","author":[{"given":"Richard C.","family":"Brewster","sequence":"first","affiliation":[]},{"given":"Gary","family":"MacGillivray","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2006.03.036_bib1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(92)90033-C","article-title":"Graphs with edge-preserving majority functions","volume":"103","author":"Bandelt","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.03.036_bib2","unstructured":"R.C. Brewster, T. Feder, P. Hell, J. Huang, G. MacGillivray, Near unanimity functions and varieties of graphs, 2003, submitted for publication."},{"key":"10.1016\/j.disc.2006.03.036_bib3","first-page":"97","article-title":"Undecidable generalized colouring problems","volume":"26","author":"Dukes","year":"1998","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.disc.2006.03.036_bib4","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/S0895480199383353","article-title":"Classification of homomorphisms to oriented cycles, and of k-partite satisfiability","volume":"14","author":"Feder","year":"2001","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2006.03.036_bib5","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1006\/jctb.1997.1812","article-title":"List homomorphisms to reflexive graphs","volume":"72","author":"Feder","year":"1998","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/j.disc.2006.03.036_bib6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/jgt.10073","article-title":"Bi-arc graphs and the complexity of list homomorphisms","volume":"42","author":"Feder","year":"2003","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2006.03.036_bib7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1137\/S0097539794266766","article-title":"The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory","volume":"28","author":"Feder","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.disc.2006.03.036_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 B"},{"key":"10.1016\/j.disc.2006.03.036_bib9","doi-asserted-by":"crossref","first-page":"544","DOI":"10.4153\/CJM-1987-025-1","article-title":"Absolute retracts and varieties of reflexive graphs","volume":"XXXIX","author":"Hell","year":"1987","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.disc.2006.03.036_bib10","doi-asserted-by":"crossref","first-page":"1299","DOI":"10.4153\/CJM-1986-066-9","article-title":"A classification of reflexive graphs: the use of \u201choles\u201d","volume":"XXXVIII","author":"Jawhari","year":"1986","journal-title":"Canad. J. Math."},{"key":"10.1016\/j.disc.2006.03.036_bib11","unstructured":"C. Loten, Retractions of chordal and related graphs, Ph.D. Thesis, Simon Fraser University, 2003."},{"key":"10.1016\/j.disc.2006.03.036_bib12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0012-365X(83)90159-0","article-title":"The smallest graph variety containing all paths","volume":"43","author":"Nowakowski","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2006.03.036_bib13","unstructured":"A. Quilliot, Homomorphismes, points fixes, r\u00e9tractions et jeux de poursouite dans les graphes, let ensembles ordon\u00e9es et les espaces m\u00e9triques. Th\u00e8se d\u2019Etat, Universit\u00e9 de Paris VI, 1983."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X06002226?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X06002226?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,15]],"date-time":"2019-01-15T14:22:30Z","timestamp":1547562150000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X06002226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":13,"journal-issue":{"issue":"15","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["S0012365X06002226"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2006.03.036","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2006,8]]}}}