{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T07:00:48Z","timestamp":1775718048519,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:00:00Z","timestamp":1772755200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T00:00:00Z","timestamp":1772755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research, India","doi-asserted-by":"publisher","award":["09\/731(0169)\/2019-EMR-I"],"award-info":[{"award-number":["09\/731(0169)\/2019-EMR-I"]}],"id":[{"id":"10.13039\/501100001412","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":[[2026,4]]},"DOI":"10.1007\/s00373-026-03029-5","type":"journal-article","created":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T03:28:49Z","timestamp":1772767729000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Word-Representation of Melon Graphs"],"prefix":"10.1007","volume":"42","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-3711-2827","authenticated-orcid":false,"given":"Khyodeno","family":"Mozhui","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0795-1346","authenticated-orcid":false,"given":"K. V.","family":"Krishna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,6]]},"reference":[{"key":"3029_CR1","unstructured":"Akg\u00fcn, O., Gent, I., Kitaev, S., Zantema, H.: Solving computational problems in the theory of word-representable graphs. J. Integer Seq. 22(2), Art. 19.2.5, 18 (2019)"},{"issue":"1","key":"3029_CR2","doi-asserted-by":"publisher","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."},{"key":"3029_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1002\/net.3230020103","volume":"2","author":"KA Baker","year":"1972","unstructured":"Baker, K.A., Fishburn, P.C., Roberts, F.S.: Partial orders of dimension $$2$$. Networks 2, 11\u201328 (1972)","journal-title":"Networks"},{"key":"3029_CR4","doi-asserted-by":"crossref","unstructured":"Bir\u00f3, C., Bosek, B.o., Smith, H.C., Trotter, W.T., Wang, R., Young, S.J.: Planar posets that are accessible from below have dimension at most 6. Order 38(1), 21\u201336 (2021)","DOI":"10.1007\/s11083-020-09525-4"},{"issue":"1","key":"3029_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jctb.1994.1008","volume":"60","author":"A Bouchet","year":"1994","unstructured":"Bouchet, A.: Circle graph obstructions. J. Combin. Theory Ser. B 60(1), 107\u2013144 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"11","key":"3029_CR6","doi-asserted-by":"publisher","first-page":"2633","DOI":"10.1016\/j.disc.2016.11.028","volume":"340","author":"C Brause","year":"2017","unstructured":"Brause, C., Kemnitz, A., Marangio, M., Pruchnewski, A., Voigt, M.: Sum choice number of generalized $$\\theta $$-graphs. Discrete Math. 340(11), 2633\u20132640 (2017)","journal-title":"Discrete Math."},{"issue":"1","key":"3029_CR7","first-page":"3","volume":"24","author":"B Broere","year":"2019","unstructured":"Broere, B., Zantema, H.: The $$k$$-dimensional cube is $$k$$-representable. J. Autom. Lang. Comb. 24(1), 3\u201312 (2019)","journal-title":"J. Autom. Lang. Comb."},{"issue":"5","key":"3029_CR8","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1007\/s00373-014-1441-1","volume":"31","author":"JM Carraher","year":"2015","unstructured":"Carraher, J.M., Mahoney, T., Puleo, G.J., West, D.B.: Sum-paintability of generalized theta-graphs. Graphs Combin. 31(5), 1325\u20131334 (2015)","journal-title":"Graphs Combin."},{"issue":"5","key":"3029_CR9","doi-asserted-by":"publisher","first-page":"1749","DOI":"10.1007\/s00373-016-1693-z","volume":"32","author":"HZQ Chen","year":"2016","unstructured":"Chen, H.Z.Q., Kitaev, S., Sun, B.Y.: Word-representability of face subdivisions of triangular grid graphs. Graphs Combin. 32(5), 1749\u20131761 (2016)","journal-title":"Graphs Combin."},{"key":"3029_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.dam.2023.07.022","volume":"341","author":"T Dissaux","year":"2023","unstructured":"Dissaux, T., Ducoffe, G., Nisse, N., Nivelle, S.: Treelength of series-parallel graphs. Discrete Appl. Math. 341, 16\u201330 (2023)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"3029_CR11","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/1097-0118(200010)35:2<89::AID-JGT3>3.0.CO;2-A","volume":"35","author":"D Eichhorn","year":"2000","unstructured":"Eichhorn, D., Mubayi, D., O\u2019Bryant, K., West, D.B.: The edge-bandwidth of theta graphs. J. Graph Theory 35(2), 89\u201398 (2000)","journal-title":"J. Graph Theory"},{"issue":"4","key":"3029_CR12","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/s00373-014-1430-4","volume":"31","author":"S Felsner","year":"2015","unstructured":"Felsner, S., Trotter, W.T., Wiechert, V.: The dimension of posets with planar cover graphs. Graphs Combin. 31(4), 927\u2013939 (2015)","journal-title":"Graphs Combin."},{"key":"3029_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar. 18, 25\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"3029_CR14","first-page":"131","volume":"101","author":"M Glen","year":"2017","unstructured":"Glen, M., Kitaev, S.: Word-representability of triangulations of rectangular polyomino with a single domino tile. J. Combin. Math. Combin. Comput. 101, 131\u2013144 (2017)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"3029_CR15","doi-asserted-by":"crossref","unstructured":"Halld\u00f3rsson, M.M., Kitaev, S., Pyatkin, A.: Alternation graphs. In: Graph-theoretic concepts in computer science, Lecture Notes in Comput. Sci., vol. 6986, pp. 191\u2013202. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-25870-1_18"},{"issue":"4","key":"3029_CR16","doi-asserted-by":"publisher","first-page":"2754","DOI":"10.1137\/17M111300X","volume":"31","author":"G Joret","year":"2017","unstructured":"Joret, G., Micek, P., Wiechert, V.: Planar posets have dimension at most linear in their height. SIAM J. Discrete Math. 31(4), 2754\u20132790 (2017)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"3029_CR17","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."},{"key":"3029_CR18","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. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Cham (2015)"},{"issue":"1","key":"3029_CR19","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."},{"issue":"2","key":"3029_CR20","doi-asserted-by":"publisher","first-page":"96","DOI":"10.4236\/ojdm.2011.12012","volume":"1","author":"S Kitaev","year":"2011","unstructured":"Kitaev, S., Salimov, P., Severs, C., Ulfarsson, H.: Word-representability of line graphs. Open J. Discrete Math. 1(2), 96\u2013101 (2011)","journal-title":"Open J. Discrete Math."},{"issue":"3","key":"3029_CR21","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.: Word problem of the Perkins semigroup via directed acyclic graphs. Order 25(3), 177\u2013194 (2008)","journal-title":"Order"},{"key":"3029_CR22","doi-asserted-by":"crossref","unstructured":"Limouzy, V.: Seidel minor, permutation graphs and combinatorial properties. In: O. Cheong, K.Y. Chwa, K. Park (eds.) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506, pp. 194\u2013205. Springer, Berlin Heidelberg (2010)","DOI":"10.1007\/978-3-642-17517-6_19"},{"key":"3029_CR23","first-page":"246","volume":"361","author":"H Liu","year":"2019","unstructured":"Liu, H., Zhang, R., Hu, X.: Burning number of theta graphs. Appl. Math. Comput. 361, 246\u2013257 (2019)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"3029_CR24","doi-asserted-by":"publisher","first-page":"1237","DOI":"10.1137\/21M1408439","volume":"37","author":"XC Liu","year":"2023","unstructured":"Liu, X.C., Yang, X.: On the Tur\u00e1n number of generalized theta graphs. SIAM J. Discrete Math. 37(2), 1237\u20131251 (2023)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"3029_CR25","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0012-365X(78)90012-2","volume":"23","author":"B Loerinc","year":"1978","unstructured":"Loerinc, B.: Chromatic uniqueness of the generalized $$\\theta $$-graph. Discrete Math. 23(3), 313\u2013316 (1978)","journal-title":"Discrete Math."},{"key":"3029_CR26","doi-asserted-by":"crossref","unstructured":"Mozhui, K., Krishna, K.V.: The representation number and the prn of stacked book graphs. In: Current Progress in Interdisciplinary Research, Select Papers of RIC 2024, vol. 3, pp. 337\u2013346. Springer Nature Singapore (2025)","DOI":"10.1007\/978-981-95-1853-1_22"},{"key":"3029_CR27","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.2197\/ipsjjip.33.1033","volume":"33","author":"K Mozhui","year":"2025","unstructured":"Mozhui, K., Krishna, K.V.: An upper bound for the permutation-representation number of bipartite graphs. Journal of Information Processing 33, 1033\u20131041 (2025b)","journal-title":"Journal of Information Processing"},{"key":"3029_CR28","volume-title":"Combinatorics and partially ordered sets: Dimension theory","author":"WT Trotter","year":"1992","unstructured":"Trotter, W.T.: Combinatorics and partially ordered sets: Dimension theory. Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins University Press, Baltimore, MD (1992)"},{"issue":"1","key":"3029_CR29","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/0095-8956(77)90048-X","volume":"22","author":"WT Trotter","year":"1977","unstructured":"Trotter, W.T., Moore, J.I.: The dimension of planar posets. J. Combinatorial Theory Ser. B 22(1), 54\u201367 (1977)","journal-title":"J. Combinatorial Theory Ser. B"},{"issue":"2","key":"3029_CR30","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s11083-015-9369-5","volume":"33","author":"WT Trotter","year":"2016","unstructured":"Trotter, W.T., Wang, R.: Planar posets, dimension, breadth and the number of minimal elements. Order 33(2), 333\u2013346 (2016)","journal-title":"Order"},{"issue":"3","key":"3029_CR31","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods 3(3), 351\u2013358 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"6","key":"3029_CR32","doi-asserted-by":"publisher","first-page":"2155","DOI":"10.1007\/s00373-021-02342-5","volume":"37","author":"M Zhai","year":"2021","unstructured":"Zhai, M., Fang, L., Shu, J.: On the Tur\u00e1n number of theta graphs. Graphs Combin. 37(6), 2155\u20132165 (2021)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03029-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-026-03029-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-026-03029-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:17:11Z","timestamp":1775715431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-026-03029-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,6]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["3029"],"URL":"https:\/\/doi.org\/10.1007\/s00373-026-03029-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,6]]},"assertion":[{"value":"18 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"36"}}