{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T01:55:45Z","timestamp":1773885345351,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["681988"],"award-info":[{"award-number":["681988"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["810115"],"award-info":[{"award-number":["810115"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.ejc.2025.104256","type":"journal-article","created":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T14:24:19Z","timestamp":1760797459000},"page":"104256","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PA","title":["Morphism extension classes of countable\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e97\" altimg=\"si11.svg\">\n                      <mml:mi>L<\/mml:mi>\n                    <\/mml:math>\n                    -colored graphs"],"prefix":"10.1016","volume":"132","author":[{"given":"Andr\u00e9s","family":"Aranda","sequence":"first","affiliation":[]},{"given":"David","family":"Hartman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2025.104256_b1","series-title":"Complexity of Constraints","first-page":"196","article-title":"Constraint satisfaction problems with infinite templates","author":"Bodirsky","year":"2008"},{"issue":"3","key":"10.1016\/j.ejc.2025.104256_b2","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.disc.2009.04.027","article-title":"Posets, homomorphisms and homogeneity","volume":"310","author":"Cameron","year":"2010","journal-title":"Discrete Math."},{"issue":"1\u20132","key":"10.1016\/j.ejc.2025.104256_b3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1017\/S0963548305007091","article-title":"Homomorphism-homogeneous relational structures","volume":"15","author":"Cameron","year":"2006","journal-title":"Combin. Probab. Comput."},{"issue":"2","key":"10.1016\/j.ejc.2025.104256_b4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10801-015-0636-8","article-title":"On the relational complexity of a finite permutation group","volume":"43","author":"Cherlin","year":"2016","journal-title":"J. Algebraic Combin."},{"issue":"11","key":"10.1016\/j.ejc.2025.104256_b5","first-page":"540","article-title":"Sur certaines relations qui g\u00e9n\u00e9ralisent l\u2019ordre des nombres rationnels","volume":"237","author":"Fra\u00efss\u00e9","year":"1953","journal-title":"Comptes Rendus Hebd. Des S\u00e9ances L\u2019Acad\u00e9mie Des Sci."},{"issue":"1","key":"10.1016\/j.ejc.2025.104256_b6","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0095-8956(76)90072-1","article-title":"Homogeneous graphs","volume":"20","author":"Gardiner","year":"1976","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2025.104256_b7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.ejc.2013.06.038","article-title":"Homomorphism-homogeneous l-colored graphs","volume":"35","author":"Hartman","year":"2014","journal-title":"European J. Combin."},{"issue":"2","key":"10.1016\/j.ejc.2025.104256_b8","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1515\/ms-2015-0019","article-title":"Complexities of relational structures","volume":"65","author":"Hartman","year":"2015","journal-title":"Math. Slovaca"},{"issue":"1","key":"10.1016\/j.ejc.2025.104256_b9","doi-asserted-by":"crossref","first-page":"69","DOI":"10.2140\/pjm.1971.38.69","article-title":"A family of countable homogeneous graphs","volume":"38","author":"Henson","year":"1971","journal-title":"Pacific J. Math."},{"issue":"1","key":"10.1016\/j.ejc.2025.104256_b10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/jgt.20322","article-title":"Finite homomorphism-homogeneous tournaments with loops","volume":"59","author":"Ili\u0107","year":"2008","journal-title":"J. Graph Theory"},{"issue":"4","key":"10.1016\/j.ejc.2025.104256_b11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s11083-007-9069-x","article-title":"Homomorphism-homogeneous partially ordered sets","volume":"24","author":"Ma\u0161ulovi\u0107","year":"2007","journal-title":"Order"},{"key":"10.1016\/j.ejc.2025.104256_b12","unstructured":"C. Pech, M. Pech, Constraint satisfaction with weakly oligomorphic template, manuscript submitted. preprint accessible at http:\/\/sites.dmi.rs\/personal\/pechm\/AgeHHnew.pdf."},{"issue":"3","key":"10.1016\/j.ejc.2025.104256_b13","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1002\/jgt.20478","article-title":"Homomorphism\u2013homogeneous graphs","volume":"65","author":"Rusinov","year":"2010","journal-title":"J. Graph Theory"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669825001453?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669825001453?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T20:30:35Z","timestamp":1773865835000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669825001453"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":13,"alternative-id":["S0195669825001453"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2025.104256","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Morphism extension classes of countable -colored graphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2025.104256","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104256"}}