{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T18:50:17Z","timestamp":1784227817795,"version":"3.55.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T00:00:00Z","timestamp":1540944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2015R1C1A1A02036398"],"award-info":[{"award-number":["NRF-2015R1C1A1A02036398"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2016R1D1A1B03930998"],"award-info":[{"award-number":["NRF-2016R1D1A1B03930998"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10878-018-0358-7","type":"journal-article","created":{"date-parts":[[2018,10,31]],"date-time":"2018-10-31T00:43:44Z","timestamp":1540946624000},"page":"1351-1366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On operations preserving semi-transitive orientability of graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Ilkyoo","family":"Choi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5982-7836","authenticated-orcid":false,"given":"Jinha","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minki","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"key":"358_CR1","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4153\/CJM-1959-003-9","volume":"11","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s P (1959) Graph theory and probability. Can J Math 11:34\u201338","journal-title":"Can J Math"},{"key":"358_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-25870-1_18","volume":"6986","author":"M Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson M, Kitaev S, Pyatkin A (2011) Alternation graphs. Lecture Notes Comput Sci 6986:191\u2013202","journal-title":"Lecture Notes Comput Sci"},{"key":"358_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.dam.2015.07.033","volume":"201","author":"M Halld\u00f3rsson","year":"2016","unstructured":"Halld\u00f3rsson M, Kitaev S, Pyatkin A (2016) Semi-transitive orientations and word-representable graphs. Discr Appl Math 201:164\u2013171","journal-title":"Discr Appl Math"},{"issue":"2","key":"358_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","volume":"24","author":"HA Jung","year":"1978","unstructured":"Jung HA (1978) On a class of posets and the corresponding comparability graphs. J Comb Theory Ser B 24(2):125\u2013133","journal-title":"J Comb Theory Ser B"},{"key":"358_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-62809-7_2","volume":"10396","author":"S Kitaev","year":"2017","unstructured":"Kitaev S (2017) A comprehensive introduction to the theory of word-representable graphs. Lecture Notes Comput Sci 10396:36\u201367","journal-title":"Lecture Notes Comput Sci"},{"key":"358_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25859-1","volume-title":"Words and graphs","author":"S Kitaev","year":"2015","unstructured":"Kitaev S, Lozin V (2015) Words and graphs. Springer, Berlin"},{"issue":"1","key":"358_CR7","first-page":"45","volume":"13","author":"S Kitaev","year":"2008","unstructured":"Kitaev S, Pyatkin A (2008) On representable graphs. J Autom Lang Comb 13(1):45\u201354","journal-title":"J Autom Lang Comb"},{"issue":"3","key":"358_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s11083-008-9083-7","volume":"25","author":"S Kitaev","year":"2008","unstructured":"Kitaev S, Seif S (2008) Word problem of the Perkins semigroup via directed acyclic graphs. Order 25(3):177\u2013194","journal-title":"Order"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0358-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0358-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0358-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T12:09:21Z","timestamp":1576498161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0358-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,31]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["358"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0358-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,31]]},"assertion":[{"value":"31 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}