{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:57Z","timestamp":1770972417254,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319628080","type":"print"},{"value":"9783319628097","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62809-7_2","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T08:37:57Z","timestamp":1500539877000},"page":"36-67","source":"Crossref","is-referenced-by-count":15,"title":["A Comprehensive Introduction to the Theory of Word-Representable Graphs"],"prefix":"10.1007","author":[{"given":"Sergey","family":"Kitaev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3103\/S1055134415010010","volume":"25","author":"P Akrobotu","year":"2015","unstructured":"Akrobotu, P., Kitaev, S., Mas\u00e1rov\u00e1, Z.: On word-representability of polyomino triangulations. Siberian Adv. Math. 25(1), 1\u201310 (2015)","journal-title":"Siberian Adv. Math."},{"issue":"5","key":"2_CR2","doi-asserted-by":"crossref","first-page":"1749","DOI":"10.1007\/s00373-016-1693-z","volume":"32","author":"TZQ Chen","year":"2016","unstructured":"Chen, T.Z.Q., Kitaev, S., Sun, B.Y.: Word-representability of face subdivisions of triangular grid graphs. Graphs Comb. 32(5), 1749\u20131761 (2016)","journal-title":"Graphs Comb."},{"issue":"C","key":"2_CR3","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.dam.2016.05.025","volume":"213","author":"TZQ Chen","year":"2016","unstructured":"Chen, T.Z.Q., Kitaev, S., Sun, B.Y.: Word-representability of triangulations of grid-covered cylinder graphs. Discr. Appl. Math. 213(C), 60\u201370 (2016)","journal-title":"Discr. Appl. Math."},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.dam.2014.10.024","volume":"216","author":"A Collins","year":"2017","unstructured":"Collins, A., Kitaev, S., Lozin, V.: New results on word-representable graphs. Discr. Appl. Math. 216, 136\u2013141 (2017)","journal-title":"Discr. Appl. Math."},{"key":"2_CR5","unstructured":"Gao, A., Kitaev, S., Zhang, P.: On 132-representable graphs. arXiv:1602.08965 (2016)"},{"key":"2_CR6","unstructured":"Glen, M.: Colourability and word-representability of near-triangulations. arXiv:1605.01688 (2016)"},{"key":"2_CR7","unstructured":"Glen, M.: Software. http:\/\/personal.cis.strath.ac.uk\/sergey.kitaev\/word-representable-graphs.html"},{"key":"2_CR8","unstructured":"Glen, M., Kitaev, S.: Word-representability of triangulations of rectangular polyomino with a single domino tile. J. Comb. Math. Comb. Comput. (to appear)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/978-3-642-14455-4_41","volume-title":"Developments in Language Theory","author":"MM Halld\u00f3rsson","year":"2010","unstructured":"Halld\u00f3rsson, M.M., Kitaev, S., Pyatkin, A.: Graphs capturing alternations in words. In: Gao, Y., Lu, H., Seki, S., Yu, S. (eds.) DLT 2010. LNCS, vol. 6224, pp. 436\u2013437. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14455-4_41"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-25870-1_18","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MM Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson, M.M., Kitaev, S., Pyatkin, A.: Alternation graphs. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 191\u2013202. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-25870-1_18"},{"key":"2_CR11","doi-asserted-by":"crossref","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.: Semi-transitive orientations and word-representable graphs. Discrete Appl. Math. 201, 164\u2013171 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"2_CR12","doi-asserted-by":"crossref","first-page":"2.53","DOI":"10.37236\/4946","volume":"22","author":"M Jones","year":"2015","unstructured":"Jones, M., Kitaev, S., Pyatkin, A., Remmel, J.: Representing graphs via pattern avoiding words. Electron. J. Comb. 22(2), 2.53 (2015). 20 pp","journal-title":"Electron. J. Comb."},{"key":"2_CR13","unstructured":"Kim, J., Kim, M.: Graph orientations on word-representable graphs (in preparation)"},{"key":"2_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17333-2","volume-title":"Patterns in Permutations and Words","author":"S Kitaev","year":"2011","unstructured":"Kitaev, S.: Patterns in Permutations and Words. Springer, Heidelberg (2011)"},{"issue":"2","key":"2_CR15","first-page":"97","volume":"18","author":"S Kitaev","year":"2013","unstructured":"Kitaev, S.: On graphs with representation number 3. J. Autom. Lang. Comb. 18(2), 97\u2013112 (2013)","journal-title":"J. Autom. Lang. Comb."},{"issue":"3","key":"2_CR16","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/jgt.22097","volume":"85","author":"S Kitaev","year":"2017","unstructured":"Kitaev, S.: Existence of $$u$$ -representation of graphs. J. Graph Theor. 85(3), 661\u2013668 (2017)","journal-title":"J. Graph Theor."},{"key":"2_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-25859-1","volume-title":"Words and Graphs","author":"S Kitaev","year":"2015","unstructured":"Kitaev, S., Lozin, V.: Words and Graphs. Springer, Heidelberg (2015)"},{"issue":"1","key":"2_CR18","first-page":"45","volume":"13","author":"S Kitaev","year":"2008","unstructured":"Kitaev, S., Pyatkin, A.: On representable graphs. J. Autom. Lang. Comb. 13(1), 45\u201354 (2008)","journal-title":"J. Autom. Lang. Comb."},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-22321-1_46","volume-title":"Developments in Language Theory","author":"S Kitaev","year":"2011","unstructured":"Kitaev, S., Salimov, P., Severs, C., \u00dalfarsson, H.: On the representability of line graphs. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 478\u2013479. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22321-1_46"},{"issue":"3","key":"2_CR20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s11083-008-9083-7","volume":"25","author":"S Kitaev","year":"2008","unstructured":"Kitaev, S., Seif, S.: Word problem of the Perkins semigroup via directed acyclic graphs. Order 25(3), 177\u2013194 (2008)","journal-title":"Order"},{"key":"2_CR21","unstructured":"Mandelshtam, Y.: On graphs representable by pattern-avoiding words. arXiv:1608.07614 (2016)"},{"issue":"1","key":"2_CR22","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF00337921","volume":"2","author":"O Pretzel","year":"1985","unstructured":"Pretzel, O.: On graphs that can be oriented as diagrams of ordered sets. Order 2(1), 25\u201340 (1985)","journal-title":"Order"},{"issue":"1","key":"2_CR23","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0095-8956(03)00029-7","volume":"88","author":"C Thomassen","year":"2003","unstructured":"Thomassen, C.: A short list color proof of Gr\u00f6tzsch\u2019s theorem. J. Comb. Theor. Ser. B 88(1), 189\u2013192 (2003)","journal-title":"J. Comb. Theor. Ser. B"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62809-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,13]],"date-time":"2020-10-13T01:19:05Z","timestamp":1602551945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-62809-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319628080","9783319628097"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62809-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}