{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:04:56Z","timestamp":1740107096835,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2019R1I1A1A01044161"],"award-info":[{"award-number":["NRF-2019R1I1A1A01044161"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00373-020-02232-2","type":"journal-article","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T04:00:47Z","timestamp":1600660847000},"page":"139-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Encoding Labelled p-Riordan Graphs by Words and Pattern-Avoiding Permutations"],"prefix":"10.1007","volume":"37","author":[{"given":"Kittitat","family":"Iamthong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6226-1906","authenticated-orcid":false,"given":"Ji-Hwan","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Kitaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,21]]},"reference":[{"key":"2232_CR1","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.laa.2019.05.033","volume":"579","author":"G-S Cheon","year":"2019","unstructured":"Cheon, G.-S., Jung, J.-H., Kitaev, S., Mojallal, S.A.: Riordan graphs I: structural properties. Linear Algebra Appl. 579, 89\u2013135 (2019)","journal-title":"Linear Algebra Appl."},{"key":"2232_CR2","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/j.laa.2019.04.011","volume":"575","author":"G-S Cheon","year":"2019","unstructured":"Cheon, G.-S., Jung, J.-H., Kitaev, S., Mojallal, S.A.: Riordan graphs II: spectral properties. Linear Algebra Appl. 575, 174\u2013215 (2019)","journal-title":"Linear Algebra Appl."},{"key":"2232_CR3","unstructured":"Jung, J.-H.: Diameter of io-decomposable Riordan graphs of the Bell type. arXiv:1901.11156"},{"key":"2232_CR4","unstructured":"Jung, J.-H.: Oriented Riordan graphs and their fractal property. arXiv:2009.01677"},{"key":"2232_CR5","doi-asserted-by":"publisher","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, New York (2011)"},{"key":"2232_CR6","doi-asserted-by":"crossref","unstructured":"Kitaev, S.: A Comprehensive introduction to the theory of word-representable graphs. In: Developments in Language Theory: 21st International Conference, DLT, Liege, 7\u201311 Aug 2017. Lecture Notes in Computer Science, vol. 10396, pp. 36\u201367 (2017)","DOI":"10.1007\/978-3-319-62809-7_2"},{"key":"2232_CR7","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.: Words and Graphs. Springer, Berlin (2015)"},{"key":"2232_CR8","first-page":"171","volume":"268","author":"D Kremer","year":"2003","unstructured":"Kremer, D., Shiu, W.C.: Finite transition matrices for permutations avoiding pairs of length four patterns. Discret. Appl. Math. 268, 171\u2013183 (2003)","journal-title":"Discret. Appl. Math."},{"issue":"3\u20134","key":"2232_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s000260200013","volume":"6","author":"T Mansour","year":"2002","unstructured":"Mansour, T., Robertson, A.: Refined restricted permutations avoiding subsets of patterns of length three. Ann. Combin. 6(3\u20134), 407\u2013418 (2002)","journal-title":"Ann. Combin."},{"key":"2232_CR10","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.dam.2011.07.012","volume":"164","author":"S Nicoloso","year":"2014","unstructured":"Nicoloso, S., Piestropaoli, U.: On the chromatic number of Toeplitz graphs. Discret. Appl. Math. 164, 286\u2013296 (2014)","journal-title":"Discret. Appl. Math."},{"key":"2232_CR11","unstructured":"Reyzin, L.: Mathoverflow, number of closed walks on an n-cube. https:\/\/www.mathoverflow.net\/questions\/71736\/number-of-closed-walks-on-an-n-cube"},{"key":"2232_CR12","unstructured":"Sloane, N.J.A.: The on-line encyclopedia of integer sequences. http:\/\/www.oeis.org"},{"key":"2232_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0166-218X(91)90088-E","volume":"34","author":"LV Shapiro","year":"1991","unstructured":"Shapiro, L.W., Getu, S., Woan, W.-J., Woodson, L.C.: The Riordan group. Discret. Appl. Math. 34, 229\u2013239 (1991)","journal-title":"Discret. Appl. Math."},{"key":"2232_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(95)00111-9","volume":"159","author":"R van Dal","year":"1996","unstructured":"van Dal, R., Tijssen, G., Tuza, Z., van der Veen, J., Zamfirescu, C., Zamfirescu, T.: Hamiltonian properties of Toeplitz graphs. Discret. Math. 159, 69\u201381 (1996)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02232-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02232-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02232-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T23:43:46Z","timestamp":1632181426000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02232-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,21]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2232"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02232-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,9,21]]},"assertion":[{"value":"11 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}