{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:12:05Z","timestamp":1743088325703,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031754081"},{"type":"electronic","value":"9783031754098"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-75409-8_18","type":"book-chapter","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:26Z","timestamp":1737497426000},"page":"251-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finite Vertex-Colored Ultrahomogeneous Oriented Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9191-1712","authenticated-orcid":false,"given":"Irene","family":"Heinrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4152-5773","authenticated-orcid":false,"given":"Eda","family":"Kaja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3585-8213","authenticated-orcid":false,"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,1,22]]},"reference":[{"key":"18_CR1","unstructured":"Ahlman, O.: Limit Laws, Homogenizable Structures and Their Connections. Dissertation, Uppsala University, Uppsala (2018)"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 684\u2013697. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897542","DOI":"10.1145\/2897518.2897542"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"B\u00f6ttcher, J., Foniok, J.: Ramsey properties of permutations. Electron. J. Comb. 20(1), 2 (2013). https:\/\/doi.org\/10.37236\/2978","DOI":"10.37236\/2978"},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Cherlin, G.: Two problems on homogeneous structures, revisited. In: Model Theoretic Methods in Finite Combinatorics. Contemporary Mathematics, vol.\u00a0558, pp. 319\u2013415. American Mathematical Society, Providence (2011). https:\/\/doi.org\/10.1090\/conm\/558\/11055","DOI":"10.1090\/conm\/558\/11055"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Cherlin, G., Felgner, U.: Homogeneous finite groups. J. London Math. Soc. 62(3), 784\u2013794 (2000). https:\/\/doi.org\/10.1112\/S0024610700001484, https:\/\/londmathsoc.onlinelibrary.wiley.com\/doi\/abs\/10.1112\/S0024610700001484","DOI":"10.1112\/S0024610700001484"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Cherlin, G.L.: The classification of countable homogeneous directed graphs and countable homogeneous $$n$$-tournaments. Mem. Amer. Math. Soc. 131(621), xiv+161 (1998). https:\/\/doi.org\/10.1090\/memo\/0621","DOI":"10.1090\/memo\/0621"},{"key":"18_CR7","doi-asserted-by":"publisher","unstructured":"Cherlin, G.L., Felgner, U.: Homogeneous solvable groups. J. London Math. Soc. s2-44(1), 102\u2013120 (1991). https:\/\/doi.org\/10.1112\/jlms\/s2-44.1.102, https:\/\/londmathsoc.onlinelibrary.wiley.com\/doi\/abs\/10.1112\/jlms\/s2-44.1.102","DOI":"10.1112\/jlms\/s2-44.1.102"},{"key":"18_CR8","unstructured":"Fra\u00efss\u00e9, R.: Sur certaines relations qui g\u00e9n\u00e9ralisent l\u2019ordre des nombres rationnels. Comptes Rendus l\u2019Acad. Sci. Paris 237, 540\u2013542 (1953)"},{"key":"18_CR9","doi-asserted-by":"publisher","unstructured":"Gardiner, A.: Homogeneous graphs. J. Combin. Theory Ser. B 20(1), 94\u2013102 (1976). https:\/\/doi.org\/10.1016\/0095-8956(76)90072-1","DOI":"10.1016\/0095-8956(76)90072-1"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Gill, N., Liebeck, M.W., Spiga, P.: Cherlin\u2019s Conjecture for Finite Primitive Binary Permutation Groups. Lecture Notes in Mathematics, vol. 2302. Springer, Cham (2022)","DOI":"10.1007\/978-3-030-95956-2"},{"key":"18_CR11","first-page":"76","volume":"186","author":"Y Gol\u2019fand","year":"1978","unstructured":"Gol\u2019fand, Y., Klin, M.: On k-homogeneous graphs. Algorithmic Stud. Combin. (Russ.) 186, 76\u201385 (1978)","journal-title":"Algorithmic Stud. Combin. (Russ.)"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Heinrich, I., Schneider, T., Schweitzer, P.: Classification of finite highly regular vertex-coloured graphs. arXiv preprint arXiv:2012.01058 [math.CO] (2020). https:\/\/doi.org\/10.48550\/arXiv.2012.01058","DOI":"10.48550\/arXiv.2012.01058"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ejc.2011.04.004","volume":"33","author":"T Jenkinson","year":"2012","unstructured":"Jenkinson, T., Truss, J.K., Seidel, D.: Countable homogeneous multipartite graphs. Eur. J. Combin. 33(1), 82\u2013109 (2012). https:\/\/doi.org\/10.1016\/j.ejc.2011.04.004","journal-title":"Eur. J. Combin."},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.2307\/1999974","volume":"262","author":"AH Lachlan","year":"1980","unstructured":"Lachlan, A.H., Woodrow, R.E.: Countable ultrahomogeneous undirected graphs. Trans. Amer. Math. Soc. 262(1), 51\u201394 (1980). https:\/\/doi.org\/10.2307\/1999974","journal-title":"Trans. Amer. Math. Soc."},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Lachlan, A.H.: Finite homogeneous simple digraphs. In: Stern, J. (ed.) Proceedings of the Herbrand Symposium Logic Colloquium 1981, pp. 189\u2013208. North-Holland Publishing Company (1982)","DOI":"10.1016\/S0049-237X(08)71884-6"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Lachlan, A.H.: Stable finitely homogeneous structures: a survey. In: Hart, B.T., Lachlan, A.H., Valeriote, M.A. (eds.) Algebraic Model Theory. NATO ASI Series, vol. 496, pp. 145\u2013159. Springer, Dordrecht (1997). https:\/\/doi.org\/10.1007\/978-94-015-8923-9_6","DOI":"10.1007\/978-94-015-8923-9_6"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/malq.19950410302","volume":"41","author":"AH Lachlan","year":"1995","unstructured":"Lachlan, A.H., Tripp, A.: Finite homogeneous $$3$$-graphs. Math. Logic Quart. 41(3), 287\u2013306 (1995). https:\/\/doi.org\/10.1002\/malq.19950410302","journal-title":"Math. Logic Quart."},{"issue":"2","key":"18_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1017\/S0004972700036431","volume":"60","author":"CH Li","year":"1999","unstructured":"Li, C.H.: A complete classification of finite homogeneous groups. Bull. Aust. Math. Soc. 60(2), 331\u2013334 (1999). https:\/\/doi.org\/10.1017\/S0004972700036431","journal-title":"Bull. Aust. Math. Soc."},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/j.ejc.2014.06.006","volume":"42","author":"DC Lockett","year":"2014","unstructured":"Lockett, D.C., Truss, J.K.: Homogeneous coloured multipartite graphs. Eur. J. Combin. 42, 217\u2013242 (2014). https:\/\/doi.org\/10.1016\/j.ejc.2014.06.006","journal-title":"Eur. J. Combin."},{"issue":"15","key":"18_CR20","doi-asserted-by":"publisher","first-page":"1599","DOI":"10.1016\/J.DISC.2011.01.024","volume":"311","author":"D Macpherson","year":"2011","unstructured":"Macpherson, D.: A survey of homogeneous structures. Discret. Math. 311(15), 1599\u20131634 (2011). https:\/\/doi.org\/10.1016\/J.DISC.2011.01.024","journal-title":"Discret. Math."},{"key":"18_CR21","doi-asserted-by":"publisher","unstructured":"Mekler, A.H.: Homogeneous Partially Ordered Sets. In: Sauer, N.W., et at. (eds.) Finite and Infinite Combinatorics in Sets and Logic, pp. 279\u2013288. Springer, Dordrecht (1993). https:\/\/doi.org\/10.1007\/978-94-011-2080-7_19","DOI":"10.1007\/978-94-011-2080-7_19"},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Sheehan, J.: Smoothly embeddable subgraphs. J. London Math. Soc. (2) 9, 212\u2013218 (1974\/75). https:\/\/doi.org\/10.1112\/jlms\/s2-9.2.212","DOI":"10.1112\/jlms\/s2-9.2.212"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-75409-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:10:30Z","timestamp":1737497430000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75409-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031754081","9783031754098"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75409-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"22 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gozd Martuljek","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovenia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"50","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conferences.famnit.upr.si\/event\/31\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}