{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:09:28Z","timestamp":1766178568416,"version":"3.44.0"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1016\/j.dam.2021.06.012","type":"journal-article","created":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T08:33:20Z","timestamp":1625474000000},"page":"349-363","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Compositions, decompositions, and conformability for total coloring on power of cycle graphs"],"prefix":"10.1016","volume":"323","author":[{"given":"A.","family":"Zorzi","sequence":"first","affiliation":[]},{"given":"C.M.H.","family":"Figueiredo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0003-3339-9735","authenticated-orcid":false,"given":"R.C.S.","family":"Machado","sequence":"additional","affiliation":[]},{"given":"L.M.","family":"Zatesko","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-5320-9209","authenticated-orcid":false,"given":"U.S.","family":"Souza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2021.06.012_b1","doi-asserted-by":"crossref","unstructured":"A. Zorzi, C.M.H. Figueiredo, R.C.S. Machado, U.S. Souza, Even-power of Cycles With Many Vertices are Type 1 Total Colorable, in: Proc. X Latin and American Algorithms, Graphs and Optimization Symposium, vol. 346, Belo Horizonte, Brazil, 2019, pp. 747\u2013758, https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.entcs.2019.08.065.","DOI":"10.1016\/j.entcs.2019.08.065"},{"year":"1965","series-title":"Graphs and their Chromatic Numbers","author":"Behzad","key":"10.1016\/j.dam.2021.06.012_b2"},{"key":"10.1016\/j.dam.2021.06.012_b3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BF01885700","article-title":"The chromatic class of a multigraph","volume":"1","author":"Vizing","year":"1965","journal-title":"Cybern. Syst. Anal."},{"key":"10.1016\/j.dam.2021.06.012_b4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0012-365X(92)00058-Y","article-title":"Total colouring regular bipartite graphs is NP-hard","volume":"124","author":"McDiarmid","year":"1994","journal-title":"Discrete Math."},{"year":"2006","series-title":"O problema da Colora\u00e7\u00e3o Total em classes de grafos","author":"Campos.","key":"10.1016\/j.dam.2021.06.012_b5"},{"key":"10.1016\/j.dam.2021.06.012_b6","unstructured":"J. Meidanis, Edge coloring of cycle powers is easy, (Unpublished manuscript) https:\/\/linproxy.fan.workers.dev:443\/http\/www.ic.unicamp.br\/~meidanis\/research\/edge\/cpowers.ps, 1998."},{"key":"10.1016\/j.dam.2021.06.012_b7","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.dam.2006.08.010","article-title":"A result on the total colouring of powers of cycles","volume":"155","author":"Campos","year":"2007","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2021.06.012_b8","unstructured":"S.M. Almeida, J.T. Belotti, M.M. Omai, J.F.H. Brim., The Total Coloring of the 3rd and 4th Powers of Cycles, in: Proc. VI Latin American Workshop on Cliques in Graphs (LAWCG \u201914), 32, 2014."},{"key":"10.1016\/j.dam.2021.06.012_b9","unstructured":"J. Geetha, N. Narayanan, K. Somasundaram, Total Colorings - A Survey, (Submitted) https:\/\/linproxy.fan.workers.dev:443\/https\/arxiv.org\/abs\/1812.05833v1, 2018."},{"key":"10.1016\/j.dam.2021.06.012_b10","unstructured":"S. Prajnanaswaroopa, J. Geetha, K. Somasundaram, H.-L. Fu, N. Narayanan, Total Coloring of some classes of Powers of Cycles, (Submitted) https:\/\/linproxy.fan.workers.dev:443\/https\/arxiv.org\/abs\/1910.03922, 2019."},{"key":"10.1016\/j.dam.2021.06.012_b11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0020-0190(99)00050-2","article-title":"Total-chromatic number and chromatic index of dually chordal graphs","volume":"70","author":"Figueiredo","year":"1999","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.dam.2021.06.012_b12","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ipl.2018.03.002","article-title":"Total coloring of rooted path graphs","volume":"135","author":"Golumbic","year":"2018","journal-title":"Inf. Process. Lett."},{"year":"1996","series-title":"Total Colourings of Graphs","author":"Yap","key":"10.1016\/j.dam.2021.06.012_b13"},{"key":"10.1016\/j.dam.2021.06.012_b14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00493-007-0050-5","article-title":"Total colorings of degenerate graphs","volume":"27","author":"Isobe","year":"2007","journal-title":"Combinatorica"},{"key":"10.1016\/j.dam.2021.06.012_b15","unstructured":"T.S. Murthy, A proof of the Total Coloring Conjecture, (Submitted) https:\/\/linproxy.fan.workers.dev:443\/https\/arxiv.org\/abs\/2003.09658, 2020."},{"key":"10.1016\/j.dam.2021.06.012_b16","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1112\/blms\/21.2.159","article-title":"Total colourings of graphs","volume":"21","author":"Yap.","year":"1989","journal-title":"Bull. Lond. Math. Soc."},{"key":"10.1016\/j.dam.2021.06.012_b17","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/BF02771690","article-title":"On the total coloring of certain graphs","volume":"9","author":"Rosenfeld","year":"1971","journal-title":"Israel J. Math."},{"key":"10.1016\/j.dam.2021.06.012_b18","first-page":"137","article-title":"Total chromatic number and chromatic index of split graphs","author":"Chen","year":"1995","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"10.1016\/j.dam.2021.06.012_b19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0012-365X(93)90329-R","article-title":"The total chromatic number of graphs having large maximum degree","volume":"117","author":"Hilton","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2021.06.012_b20","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(89)90187-8","article-title":"Determining the total colouring number is NP-hard","volume":"78","author":"S\u00e1nchez-Arroyo","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2021.06.012_b21","doi-asserted-by":"crossref","first-page":"1221","DOI":"10.1016\/j.tcs.2009.12.018","article-title":"Chromatic index of graphs with no cycle with a unique chord","volume":"411","author":"Machado","year":"2010","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2021.06.012_b22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1017\/S030500410006610X","article-title":"Star multigraphs with three vertices of maximum degree","volume":"100","author":"Chetwynd","year":"1986","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/j.dam.2021.06.012_b23","first-page":"195","article-title":"Some refinements of the chromatic number conjecture","volume":"66","author":"Chetwynd","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/j.dam.2021.06.012_b24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/jgt.20405","article-title":"A structure theorem for graphs with no cycle with an unique chord and its consequences","volume":"63","author":"Trotignon","year":"1994","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2021.06.012_b25","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","article-title":"Graph minors. III. Planar tree-width","volume":"36\u20131","author":"Robertson","year":"1984","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X2100250X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X2100250X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:08:54Z","timestamp":1759061334000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X2100250X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":25,"alternative-id":["S0166218X2100250X"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2021.06.012","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2022,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Compositions, decompositions, and conformability for total coloring on power of cycle graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2021.06.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}