{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T09:13:27Z","timestamp":1769764407581,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031522123","type":"print"},{"value":"9783031522130","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-52213-0_21","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"302-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Total Coloring of\u00a0Some Graph Operations"],"prefix":"10.1007","author":[{"given":"T.","family":"Kavaskar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sreelakshmi","family":"Sukumaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"key":"21_CR1","unstructured":"Behzad, M.: Graphs and their chromatic numbers. Ph.D. thesis, Michigan State University (1965)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1112\/jlms\/s1-42.1.226","volume":"42","author":"M Behzad","year":"1967","unstructured":"Behzad, M., Chartrand, G., Cooper, J.K.: The color numbers of complete graphs. J. Londan Math. Soc. 42, 226\u2013228 (1967)","journal-title":"J. Londan Math. Soc."},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s00373-018-1876-x","volume":"34","author":"J Geetha","year":"2018","unstructured":"Geetha, J., Somasundaram, K.: Total colorings of product graphs. Graphs Combin. 34(2), 339\u2013347 (2018)","journal-title":"Graphs Combin."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Geetha, J., Narayanan, N., Somasundaram, K.: Total colorings-a survey. AKCE Int. J. Graphs Combin. 1\u201313 (2023)","DOI":"10.1080\/09728600.2023.2187960"},{"key":"21_CR5","first-page":"99","volume":"165","author":"A Kemnitz","year":"2003","unstructured":"Kemnitz, A., Marangio, M.: Total colorings of cartesian product of graphs. Congr. Numer. 165, 99\u2013109 (2003)","journal-title":"Congr. Numer."},{"issue":"4","key":"21_CR6","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber graphen und ihre anwendung auf determinantentheorie und mengenlehre. Math. Ann. 77(4), 453\u2013465 (1916). (German)","journal-title":"Math. Ann."},{"issue":"1\u20133","key":"21_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0012-365X(95)00286-6","volume":"162","author":"AV Kostochka","year":"1996","unstructured":"Kostochka, A.V.: The total chromatic number of any multigraph with maximum degree five is at most seven. Discrete Math. 162(1\u20133), 199\u2013214 (1996)","journal-title":"Discrete Math."},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1137\/070688389","volume":"22","author":"L Kowalik","year":"2008","unstructured":"Kowalik, L., Sereni, J.S., Skrekovski, R.: Total coloring of plane graphs with maximum degree nine. SIAM J. Discrete Math. 22(4), 1462\u20131479 (2008)","journal-title":"SIAM J. Discrete Math."},{"issue":"16","key":"21_CR9","doi-asserted-by":"publisher","first-page":"1895","DOI":"10.1016\/j.disc.2006.03.056","volume":"306","author":"G Li","year":"2003","unstructured":"Li, G., Zhang, L.: Total chromatic number of one kind of join graphs. Discret. Math. 306(16), 1895\u20131905 (2003)","journal-title":"Discret. Math."},{"key":"21_CR10","unstructured":"Basavaraju, M., Chandran, L.S., Francis, M.C., Naskar, A.: Weakening total coloring conjecture: weak TCC and Hadwiger\u2019s conjecture on total graphs. arXiv:2107.09994v3 [math.CO] (2022)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"McDiarmid, C.J.H., S$$\\acute{a}$$nchez-Arroyo A.: Total coloring regular bipartite graphs is NP-hard. Discret. Math. 124, 155\u2013162 (1994)","DOI":"10.1016\/0012-365X(92)00058-Y"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.disc.2014.06.010","volume":"334","author":"M Chen","year":"2014","unstructured":"Chen, M., Guo, X., Li, H., Zhang, L.: Total chromatic number of generalized Mycielski graphs. Discret. Math. 334, 48\u201351 (2014)","journal-title":"Discret. Math."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/PL00009820","volume":"18","author":"M Molloy","year":"1998","unstructured":"Molloy, M., Reed, B.: A bound on total chromatic number. Combinatorica 18, 241\u2013280 (1998)","journal-title":"Combinatorica"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphs. Colloq. Math. 3, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"S\u00e1nchez-Arroyo, A.: Determining the total coloring number is NP-hard. Discrete Math. 78, 315\u2013319 (1989)","DOI":"10.1016\/0012-365X(89)90187-8"},{"issue":"6","key":"21_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0893-9659(92)90010-7","volume":"5","author":"MA Seoud","year":"1992","unstructured":"Seoud, M.A.: Total chromatic numbers. Appl. Math. Lett. 5(6), 37\u201339 (1992)","journal-title":"Appl. Math. Lett."},{"issue":"4","key":"21_CR17","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1080\/0020739970280402","volume":"28","author":"MA Seoud","year":"1997","unstructured":"Seoud, M.A., Maqsoud, A., Wilson, R.J., Williams, J.: Total colorings of cartesian products. Int. J. Math. Educ. Sci. Technol. 28(4), 481\u2013487 (1997)","journal-title":"Int. J. Math. Educ. Sci. Technol."},{"issue":"4","key":"21_CR18","first-page":"667","volume":"26","author":"S Prajnanaswaroopa","year":"2002","unstructured":"Prajnanaswaroopa, S., Geetha, J., Somasundaram, K., Hung-Lin, F., Narayanan, N.: On total coloring of some classes of regular graphs. Taiwan. J. Math. 26(4), 667\u2013683 (2002)","journal-title":"Taiwan. J. Math."},{"issue":"10","key":"21_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.3390\/a11100161","volume":"11","author":"R Vignesh","year":"2018","unstructured":"Vignesh, R., Geetha, J., Somasundaram, K.: total coloring conjecture for certain classes of graphs. Algorithms 11(10), 161 (2018)","journal-title":"Algorithms"},{"issue":"3","key":"21_CR20","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10255-007-0383-2","volume":"23","author":"Z Wang","year":"2007","unstructured":"Wang, Z., Yan, L., Zhang, Z.: Vertex distinguishing equitable total chromatic number of join graph. Acta Math. Appl. Sinica 23(3), 433\u2013438 (2007)","journal-title":"Acta Math. Appl. Sinica"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Yap, H.P.: Total Colorings of Graphs. Lecture Notes in Mathematics. Springer, Berlin (1996). https:\/\/doi.org\/10.1007\/BFb0092895","DOI":"10.1007\/BFb0092895"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52213-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:24Z","timestamp":1768281744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"14 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhilai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}