{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T08:28:12Z","timestamp":1769761692855,"version":"3.49.0"},"reference-count":12,"publisher":"World Scientific Pub Co Pte Ltd","issue":"01","funder":[{"name":"SERB-DST","award":["Grant SR\/S4\/MS: 867\/14"],"award-info":[{"award-number":["Grant SR\/S4\/MS: 867\/14"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2019,2]]},"abstract":"<jats:p> A total coloring of a graph [Formula: see text] is an assignment of colors to the elements of the graph [Formula: see text] such that no adjacent vertices and edges receive the same color. The total chromatic number of a graph [Formula: see text], denoted by [Formula: see text], is the minimum number of colors that suffice in a total coloring. Behzad and Vizing conjectured that for any simple graph [Formula: see text], [Formula: see text], where [Formula: see text] is the maximum degree of [Formula: see text]. In this paper, we prove the tight bound of the total coloring conjecture for the three types of corona products (vertex, edge and neighborhood) of graphs. <\/jats:p>","DOI":"10.1142\/s1793830919500149","type":"journal-article","created":{"date-parts":[[2018,12,9]],"date-time":"2018-12-09T21:00:59Z","timestamp":1544389259000},"page":"1950014","source":"Crossref","is-referenced-by-count":2,"title":["Total coloring conjecture for vertex, edge and neighborhood corona products of graphs"],"prefix":"10.1142","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2454-7356","authenticated-orcid":false,"given":"Radhakrishnan","family":"Vignesh","sequence":"first","affiliation":[{"name":"Department of Mathematics, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Coimbatore-641112, India"}]},{"given":"Jayabalan","family":"Geetha","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Coimbatore-641112, India"}]},{"given":"Kanagasabapathi","family":"Somasundaram","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Amrita School of Engineering, Amrita Vishwa Vidyapeetham, Coimbatore-641112, India"}]}],"member":"219","published-online":{"date-parts":[[2019,2,8]]},"reference":[{"key":"S1793830919500149BIB001","first-page":"81","volume":"38","author":"Abdolhosseinzadeh I. R.","year":"2017","journal-title":"Italian Pure Appl. Math."},{"issue":"1","key":"S1793830919500149BIB002","first-page":"51","volume":"13","author":"Adiga C.","year":"2018","journal-title":"Iranian J. Math. Sci. Inform."},{"key":"S1793830919500149BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.09.030"},{"issue":"1","key":"S1793830919500149BIB005","first-page":"1","volume":"118","author":"Chitra K. P.","year":"2015","journal-title":"Int. J. Comput. Appl."},{"issue":"3","key":"S1793830919500149BIB006","first-page":"493","volume":"35","author":"Gopalapillai I.","year":"2011","journal-title":"Kragujevac J. Math."},{"key":"S1793830919500149BIB007","doi-asserted-by":"publisher","DOI":"10.13001\/1081-3810.1395"},{"key":"S1793830919500149BIB008","doi-asserted-by":"publisher","DOI":"10.1080\/03081087.2014.941292"},{"key":"S1793830919500149BIB009","first-page":"1","volume":"1","author":"Luo Y.","year":"2017","journal-title":"Discrete Math. Algorithm. Appl."},{"issue":"1","key":"S1793830919500149BIB010","first-page":"15","volume":"68","author":"Mohan S.","year":"2017","journal-title":"Australas. J. Combin."},{"key":"S1793830919500149BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/0893-9659(92)90010-7"},{"key":"S1793830919500149BIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2017.01.005"},{"key":"S1793830919500149BIB014","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0092895"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830919500149","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T08:46:36Z","timestamp":1565167596000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830919500149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2]]},"references-count":12,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2019,2,8]]},"published-print":{"date-parts":[[2019,2]]}},"alternative-id":["10.1142\/S1793830919500149"],"URL":"https:\/\/doi.org\/10.1142\/s1793830919500149","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2]]}}}