{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T18:25:10Z","timestamp":1703010310732},"reference-count":5,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:p> A total coloring of a graph is an assignment of colors to all the elements of the graph such that no two adjacent or incident elements receive the same color. A graph [Formula: see text] is prismatic, if for every triangle [Formula: see text], every vertex not in [Formula: see text] has exactly one neighbor in [Formula: see text]. In this paper, we prove the total coloring conjecture (TCC) for prismatic graphs and the tight bound of the TCC for some classes of prismatic graphs. <\/jats:p>","DOI":"10.1142\/s1793830920500329","type":"journal-article","created":{"date-parts":[[2020,1,31]],"date-time":"2020-01-31T08:17:17Z","timestamp":1580458637000},"page":"2050032","source":"Crossref","is-referenced-by-count":1,"title":["Total coloring of the prismatic graphs"],"prefix":"10.1142","volume":"12","author":[{"given":"S.","family":"Mohan","sequence":"first","affiliation":[{"name":"Department of Mathematics, Amrita School of Engineering \u2014 Coimbatore, Amrita Vishwa Vidyapeetham, Coimbatore, India"},{"name":"Department of Mathematics, School of Engineering, Presidency University, Bengaluru, India"}]},{"given":"K.","family":"Somasundaram","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Amrita School of Engineering \u2014 Coimbatore, Amrita Vishwa Vidyapeetham, Coimbatore, India"}]}],"member":"219","published-online":{"date-parts":[[2020,3,17]]},"reference":[{"key":"S1793830920500329BIB002","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511734885.008"},{"key":"S1793830920500329BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.02.002"},{"key":"S1793830920500329BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2007.06.006"},{"key":"S1793830920500329BIB005","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90329-R"},{"key":"S1793830920500329BIB007","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700033176"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830920500329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T10:48:43Z","timestamp":1594205323000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830920500329"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,17]]},"references-count":5,"journal-issue":{"issue":"03","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["10.1142\/S1793830920500329"],"URL":"https:\/\/doi.org\/10.1142\/s1793830920500329","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,17]]}}}