{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:17:39Z","timestamp":1753885059574,"version":"3.41.2"},"reference-count":18,"publisher":"World Scientific Pub Co Pte Ltd","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:p> Total coloring is a function that assigns colors to the vertices and edges of the graph such that the adjacent and the incident elements receive different colors. The minimum number of colors required for a proper total coloring of a graph [Formula: see text] is called the total chromatic number of [Formula: see text] and is denoted by [Formula: see text]. Behzad\u2013Vizing conjecture (Total Coloring Conjecture) states that for any graph [Formula: see text], [Formula: see text], where [Formula: see text] is the maximum degree of [Formula: see text]. In this paper, we verify the Behzad\u2013Vizing conjecture for some product graphs. <\/jats:p>","DOI":"10.1142\/s1793830923500994","type":"journal-article","created":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T10:23:18Z","timestamp":1699870998000},"source":"Crossref","is-referenced-by-count":0,"title":["Total chromatic number for certain classes of product graphs"],"prefix":"10.1142","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1306-1238","authenticated-orcid":false,"given":"T. P.","family":"Sandhiya","sequence":"first","affiliation":[{"name":"Department of Mathematics, Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham, Coimbatore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0558-5389","authenticated-orcid":false,"given":"J.","family":"Geetha","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham, Coimbatore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2226-1845","authenticated-orcid":false,"given":"K.","family":"Somasundaram","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Amrita School of Physical Sciences, Amrita Vishwa Vidyapeetham, Coimbatore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"S1793830923500994BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2012.11.011"},{"key":"S1793830923500994BIB003","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2021.11.038"},{"key":"S1793830923500994BIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113340"},{"key":"S1793830923500994BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-018-1876-x"},{"key":"S1793830923500994BIB006","first-page":"1","author":"Geetha J.","year":"2023","journal-title":"AKCE Int. J. Graphs Combin."},{"key":"S1793830923500994BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90329-R"},{"volume-title":"Product Graphs: Structure and Recognition","year":"2000","author":"Imrich W.","key":"S1793830923500994BIB008"},{"key":"S1793830923500994BIB009","doi-asserted-by":"publisher","DOI":"10.55016\/ojs\/cdm.v15i1.62679"},{"key":"S1793830923500994BIB010","first-page":"99","volume":"165","author":"Kemnitz A.","year":"2003","journal-title":"Congr. Numer."},{"key":"S1793830923500994BIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2016.05.016"},{"key":"S1793830923500994BIB012","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-009-0296-8"},{"key":"S1793830923500994BIB013","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(89)90187-8"},{"key":"S1793830923500994BIB014","doi-asserted-by":"publisher","DOI":"10.1142\/S1793830921501299"},{"key":"S1793830923500994BIB015","doi-asserted-by":"publisher","DOI":"10.1080\/0020739970280402"},{"key":"S1793830923500994BIB016","doi-asserted-by":"publisher","DOI":"10.3390\/a11100161"},{"key":"S1793830923500994BIB018","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0092895"},{"key":"S1793830923500994BIB019","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700035801"},{"key":"S1793830923500994BIB020","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-9659(02)00042-3"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830923500994","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T08:37:13Z","timestamp":1727685433000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S1793830923500994"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"references-count":18,"journal-issue":{"issue":"07","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["10.1142\/S1793830923500994"],"URL":"https:\/\/doi.org\/10.1142\/s1793830923500994","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"type":"print","value":"1793-8309"},{"type":"electronic","value":"1793-8317"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"article-number":"2350099"}}