{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T09:13:27Z","timestamp":1778058807261,"version":"3.51.4"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10878-026-01416-5","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T16:03:50Z","timestamp":1776096230000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Genus of Cartesian products of complete graph $$K_{12t+7}$$ with cycles and paths"],"prefix":"10.1007","volume":"51","author":[{"given":"Jyoti Anant","family":"Pulgam","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7706-3286","authenticated-orcid":false,"given":"Prashant","family":"Malavadkar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,13]]},"reference":[{"issue":"1\u20133","key":"1416_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0012-365X(95)00215-I","volume":"142","author":"D Archdeacon","year":"1995","unstructured":"Archdeacon D, Grable DA (1995) The genus of a random graph. Discret Math 142(1\u20133):21\u201337. https:\/\/doi.org\/10.1016\/0012-365X(95)00215-I","journal-title":"Discret Math"},{"key":"1416_CR2","doi-asserted-by":"publisher","first-page":"494","DOI":"10.4153\/CJM-1965-048-6","volume":"17","author":"LW Beineke","year":"1965","unstructured":"Beineke LW, Harary F (1965) The genus of the n-cube. Can J Math 17:494\u2013496. https:\/\/doi.org\/10.4153\/CJM-1965-048-6","journal-title":"Can J Math"},{"key":"1416_CR3","unstructured":"Blakeslee L (2022) On the genus of random regular graphs. arXiv preprint arXiv:2210.15162"},{"key":"1416_CR4","unstructured":"Broeders P K\u00f6nigsberg, euler and the origins of graph theory. https:\/\/www.slideshare.net\/pupbroeders\/knigsberg-euler-and-the-origins-of-graph-theory. Accessed: 2025-07-09"},{"key":"1416_CR5","doi-asserted-by":"publisher","unstructured":"Chartrand G, Lesniak L, Zhang P (2011) Graphs and digraphs, 5th edn. https:\/\/doi.org\/10.1201\/b14892","DOI":"10.1201\/b14892"},{"issue":"1\u20133","key":"1416_CR6","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0012-365X(97)81815-8","volume":"178","author":"DL Craft","year":"1998","unstructured":"Craft DL (1998) On the genus of joins and compositions of graphs. Discret Math 178(1\u20133):25\u201350","journal-title":"Discret Math"},{"issue":"2","key":"1416_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10878-025-01266-7","volume":"49","author":"M Galea","year":"2025","unstructured":"Galea M, Gauci JB (2025) The minimum orientable genus of the repeated cartesian product of graphs. J Comb Optim 49(2):31. https:\/\/doi.org\/10.1007\/s10878-025-01266-7","journal-title":"J Comb Optim"},{"key":"1416_CR8","unstructured":"Gross JL, Tucker TW (2001) Topological graph theory. Courier Corporation"},{"issue":"4","key":"1416_CR9","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1080\/00029890.2020.1867472","volume":"128","author":"RH Hammack","year":"2021","unstructured":"Hammack RH, Kainen PC (2021) A new view of hypercube genus. Am Math Mon 128(4):352\u2013359. https:\/\/doi.org\/10.1080\/00029890.2020.1867472","journal-title":"Am Math Mon"},{"key":"1416_CR10","unstructured":"Hartsfield N, Ringel G (2003) Pearls in graph theory: a comprehensive introduction. Courier Corporation"},{"key":"1416_CR11","volume-title":"History of topology","year":"1999","unstructured":"James IM (ed) (1999) History of topology. North-Holland, Amsterdam"},{"key":"1416_CR12","doi-asserted-by":"publisher","unstructured":"Jing Y, Mohar B (2020) Efficient polynomial-time approximation scheme for the genus of dense graphs. arXiv preprint arXiv:2011.08049. https:\/\/doi.org\/10.1145\/3690821","DOI":"10.1145\/3690821"},{"key":"1416_CR13","doi-asserted-by":"publisher","unstructured":"Lehner F, Miraftab B (2024) Basis number of bounded genus graphs. arXiv preprint arXiv:2410.10566. https:\/\/doi.org\/10.48550\/arXiv.2410.10566","DOI":"10.48550\/arXiv.2410.10566"},{"issue":"3","key":"1416_CR14","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00373-022-02488-w","volume":"38","author":"C Millichap","year":"2022","unstructured":"Millichap C, Salinas F (2022) Embedding grid graphs on surfaces. Graphs Comb 38(3):87. https:\/\/doi.org\/10.1007\/s00373-022-02488-w","journal-title":"Graphs Comb"},{"issue":"4","key":"1416_CR15","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/jgt.3190060403","volume":"6","author":"T Pisanski","year":"1982","unstructured":"Pisanski T (1982) Nonorientable genus of cartesian products of regular graphs. J Graph Theory 6(4):391\u2013402. https:\/\/doi.org\/10.1002\/jgt.3190060403","journal-title":"J Graph Theory"},{"key":"1416_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02993245","volume":"28","author":"G Ringel","year":"1965","unstructured":"Ringel G (1965) Das geschlecht des vollst\u00e4ndigen paaren graphen. Abh Math Semin Univ Hambg 28:139\u2013150. https:\/\/doi.org\/10.1007\/BF02993245","journal-title":"Abh Math Semin Univ Hambg"},{"issue":"2","key":"1416_CR17","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1073\/pnas.60.2.438","volume":"60","author":"G Ringel","year":"1968","unstructured":"Ringel G, Youngs JW (1968) Solution of the heawood map-coloring problem. Proc Natl Acad Sci 60(2):438\u2013445","journal-title":"Proc Natl Acad Sci"},{"issue":"4","key":"1416_CR18","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0021-9800(69)80062-1","volume":"7","author":"G Ringel","year":"1969","unstructured":"Ringel G, Youngs JWT (1969) Solution of the heawood map-coloring problem-case 8. J Comb Theory 7(4):353\u2013363. https:\/\/doi.org\/10.1016\/S0021-9800(69)80062-1","journal-title":"J Comb Theory"},{"issue":"4","key":"1416_CR19","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/0196-6774(89)90006-0","volume":"10","author":"C Thomassen","year":"1989","unstructured":"Thomassen C (1989) The graph genus problem is np-complete. J Algorithms 10(4):568\u2013576. https:\/\/doi.org\/10.1016\/0196-6774(89)90006-0","journal-title":"J Algorithms"},{"key":"1416_CR20","first-page":"253","volume":"2","author":"K Wagner","year":"1937","unstructured":"Wagner K (1937) \u00dcber eine erweiterung eines satzes von kuratowski. Deutsche Mathematik 2:253\u2013280","journal-title":"Deutsche Mathematik"},{"issue":"2","key":"1416_CR21","doi-asserted-by":"publisher","first-page":"322","DOI":"10.3390\/sym15020322","volume":"15","author":"L Wan","year":"2023","unstructured":"Wan L (2023) The genus of a graph: a survey. Symmetry 15(2):322. https:\/\/doi.org\/10.3390\/sym15020322","journal-title":"Symmetry"},{"key":"1416_CR22","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West DB (2001) Introduction to graph theory, vol 2. Prentice Hall, Upper Saddle River"},{"key":"1416_CR23","doi-asserted-by":"publisher","unstructured":"White AT (1969) The genus of cartesian products of graphs. https:\/\/doi.org\/10.25335\/ssds-p158","DOI":"10.25335\/ssds-p158"},{"issue":"3","key":"1416_CR24","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0021-9800(69)80027-X","volume":"7","author":"AT White","year":"1969","unstructured":"White AT (1969) The genus of the complete tripartite graph kmn, n, n. J Comb Theory 7(3):283\u2013285. https:\/\/doi.org\/10.1016\/S0021-9800(69)80027-X","journal-title":"J Comb Theory"},{"issue":"2","key":"1416_CR25","doi-asserted-by":"publisher","first-page":"393","DOI":"10.2307\/1995503","volume":"151","author":"AT White","year":"1970","unstructured":"White AT (1970) The genus of repeated cartesian products of bipartite graphs. Trans Am Math Soc 151(2):393\u2013404. https:\/\/doi.org\/10.2307\/1995503","journal-title":"Trans Am Math Soc"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01416-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01416-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01416-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T08:20:41Z","timestamp":1778055641000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01416-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1416"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01416-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"9 July 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 April 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":"There are no relevant financial or non-financial interests to declare by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"38"}}