{"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":1775639079928,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,12,1]],"date-time":"1984-12-01T00:00:00Z","timestamp":470707200000},"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":10455,"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":[[1984,12]]},"DOI":"10.1016\/0095-8956(84)90056-x","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"235-244","source":"Crossref","is-referenced-by-count":29,"title":["Symmetric graphs and interpretations"],"prefix":"10.1016","volume":"37","author":[{"given":"Emo","family":"Welzl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(84)90056-X_BIB1","first-page":"167","article-title":"On graphs of Ramsey type","volume":"1","author":"Burr","year":"1976","journal-title":"Ars Combin."},{"key":"10.1016\/0095-8956(84)90056-X_BIB2","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(84)90056-X_BIB3","author":"Fellner","year":"1981"},{"key":"10.1016\/0095-8956(84)90056-X_BIB4","author":"Harary","year":"1969"},{"key":"10.1016\/0095-8956(84)90056-X_BIB5","author":"Hedetniemi","year":"1966","journal-title":"Homomorphism of Graphs and Automata"},{"key":"10.1016\/0095-8956(84)90056-X_BIB6","first-page":"213","article-title":"Homomorphism interpolation and approximation","volume":"15","author":"Hedrlin","year":"1982","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0095-8956(84)90056-X_BIB7","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/BF01297617","article-title":"Symmetric relations (undirected graphs) with given semigroups","volume":"69","author":"Hedrlin","year":"1965","journal-title":"Monatsh. Math."},{"key":"10.1016\/0095-8956(84)90056-X_BIB8","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1111\/j.1749-6632.1979.tb17773.x","article-title":"An introduction to the category of graphs","volume":"328","author":"Hell","year":"1979","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/0095-8956(84)90056-X_BIB9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1111\/j.1749-6632.1979.tb32801.x","article-title":"Graphs with forbidden homomorphic images","volume":"319","author":"Hell","year":"1979","journal-title":"Ann. New York Acad. Sci."},{"key":"10.1016\/0095-8956(84)90056-X_BIB10","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(84)90056-X_BIB11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01786982","article-title":"Finitary and infinitary interpretation of languages","volume":"15","author":"Maurer","year":"1982","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0095-8956(84)90056-X_BIB12","doi-asserted-by":"crossref","first-page":"128","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(84)90056-X_BIB13","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01210984","article-title":"Graph derivatives","volume":"76","author":"Sabidussi","year":"1961","journal-title":"Math. Z."},{"key":"10.1016\/0095-8956(84)90056-X_BIB14","author":"Salomaa","year":"1981"},{"key":"10.1016\/0095-8956(84)90056-X_BIB15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.5186\/aasfm.1981.0619","article-title":"On color-families of graphs","volume":"6","author":"Salomaa","year":"1981","journal-title":"Ann. Acad. Sci. Fenn. Ser. A I Math."},{"key":"10.1016\/0095-8956(84)90056-X_BIB16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(82)90129-3","article-title":"Color families are dense","volume":"17","author":"Welzl","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0095-8956(84)90056-X_BIB17","author":"Wood","year":"1980"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568490056X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589568490056X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T16:20:45Z","timestamp":1548778845000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589568490056X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,12]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,12]]}},"alternative-id":["009589568490056X"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(84)90056-x","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1984,12]]}}}