{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:30:56Z","timestamp":1649039456829},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3674,"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":[[2003,8]]},"DOI":"10.1016\/s0012-365x(02)00864-6","type":"journal-article","created":{"date-parts":[[2003,2,28]],"date-time":"2003-02-28T14:00:13Z","timestamp":1046440813000},"page":"33-42","source":"Crossref","is-referenced-by-count":0,"title":["Homomorphisms and amalgamation"],"prefix":"10.1016","volume":"270","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"1\u20133","key":"10.1016\/S0012-365X(02)00864-6_BIB1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0012-365X(94)00191-K","article-title":"Core-like properties of infinite graphs and structures, Proceedings of the 14th British Combinatorial Conference","volume":"138","author":"Bauslaugh","year":"1995","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/S0012-365X(02)00864-6_BIB2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1006\/jctb.1996.0068","article-title":"Cores and compactness of infinite directed graphs","volume":"68","author":"Bauslaugh","year":"1996","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(02)00864-6_BIB3","unstructured":"A. Bonato, Colouring, generics, and free amalgams, Ph.D. Thesis, Department of Pure Mathematics, University of Waterloo, 1998."},{"issue":"1\u20133","key":"10.1016\/S0012-365X(02)00864-6_BIB4","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0012-365X(01)00158-3","article-title":"A family of universal pseudo-homogeneous G-colourable graphs","volume":"247","author":"Bonato","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(02)00864-6_BIB5","first-page":"2","article-title":"Relation et multirelation pseudo-homog\u00e8nes","volume":"265","author":"Calais","year":"1967","journal-title":"C.R. Acad. Sci. Paris Ser. A-B"},{"key":"10.1016\/S0012-365X(02)00864-6_BIB6","doi-asserted-by":"crossref","unstructured":"P.J. Cameron, The random graph, in: R.L. Graham, J. Ne\u0161et\u0159il (Eds.), Algorithms and Combinatorics, Vol. 14, Springer, New York, 1997, pp. 333\u2013351.","DOI":"10.1007\/978-3-642-60406-5_32"},{"issue":"621","key":"10.1016\/S0012-365X(02)00864-6_BIB7","first-page":"161","article-title":"The classification of countable homogeneous directed graphs and countable homogeneous n-tournaments","volume":"131","author":"Cherlin","year":"1998","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(02)00864-6_BIB8","first-page":"540","article-title":"Sur certains relations qui g\u00e9n\u00e9ralisent l'ordre des nombres rationnels","volume":"237","author":"Fra\u0131\u0308ss\u00e9","year":"1953","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/S0012-365X(02)00864-6_BIB9","series-title":"Theory of Relations","author":"Fra\u0131\u0308ss\u00e9","year":"1986"},{"key":"10.1016\/S0012-365X(02)00864-6_BIB10","series-title":"Graph Symmetry","first-page":"107","article-title":"Graph homomorphisms: structure and symmetry","volume":"Vol. 497","author":"Hahn","year":"1997"},{"issue":"1","key":"10.1016\/S0012-365X(02)00864-6_BIB11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1090\/S0002-9947-1980-0583847-2","article-title":"Countable ultrahomogeneous undirected graphs","volume":"262","author":"Lachlan","year":"1980","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0012-365X(02)00864-6_BIB12","first-page":"289","article-title":"The first-order theory of n-colourable graphs","volume":"250","author":"Wheeler","year":"1979","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/S0012-365X(02)00864-6_BIB13","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/(SICI)1097-0118(199609)23:1<33::AID-JGT3>3.0.CO;2-L","article-title":"Uniquely H-colorable graphs with large girth","volume":"23","author":"Zhu","year":"1996","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/S0012-365X(02)00864-6_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1097-0118(199901)30:1<1::AID-JGT1>3.0.CO;2-P","article-title":"Construction of uniquely H-colorable graphs","volume":"30","author":"Zhu","year":"1999","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X02008646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T08:52:23Z","timestamp":1553676743000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X02008646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0012365X02008646"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(02)00864-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}