{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T09:20:10Z","timestamp":1747732810691},"reference-count":14,"publisher":"EDP Sciences","issue":"2","license":[{"start":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T00:00:00Z","timestamp":1678838400000},"content-version":"vor","delay-in-days":14,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2022,10,15]]},"published-print":{"date-parts":[[2023,3]]},"abstract":"<jats:p>The total dominator total coloring of a graph is a total coloring of the graph such that each object (vertex or edge) of the graph is adjacent or incident to every object of some color class. The minimum number of the color classes of a total dominator total coloring of a graph is called the total dominator total chromatic number of the graph. In (A.P. Kazemi, F. Kazemnejad and S. Moradi, <jats:italic>Contrib. Discrete Math.<\/jats:italic> (2022).), the authors initiated to study the total dominator total coloring of a graph and found some useful results, and presented some problems. Finding the total dominator total chromatic numbers of cycles and paths were two of them which we consider them here.<\/jats:p>","DOI":"10.1051\/ro\/2022183","type":"journal-article","created":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T08:07:46Z","timestamp":1666080466000},"page":"383-399","source":"Crossref","is-referenced-by-count":1,"title":["Total dominator total chromatic numbers of cycles and paths"],"prefix":"10.1051","volume":"57","author":[{"given":"Adel P.","family":"Kazemi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farshad","family":"Kazemnejad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2023,3,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1017\/S0305004100041657","volume":"63","author":"Behzad","year":"1967","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"R2","unstructured":"Garey M.R. and Johnson D.S., Computers and Intractability, W.H. Freeman and Co. (1978)."},{"key":"R3","unstructured":"Haynes T.W., Hedetniemi S.T. and Slater P.J. (eds), Fundamentals Domination in Graphs. Marcel Dekker Inc., New York (1998)."},{"key":"R4","unstructured":"Haynes T.W., Hedetniemi S.T. and Slater P.J. (eds), Domination in Graphs: Advanced Topics. Marcel Dekker Inc., New York (1998)."},{"key":"R5","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1007\/s00373-014-1425-1","volume":"31","author":"Henning","year":"2015","journal-title":"Graphs Combin."},{"key":"R6","unstructured":"Henning M.A. and Yeo A., Total Domination in Graphs. Springer Monographs in Mathematics (2013) ISBN: 978-1-4614-6524-9 (Print) 978-1-4614-6525-6 (Online)."},{"key":"R7","first-page":"105","volume":"115","author":"Jalilolghadr","year":"2020","journal-title":"Util. Math."},{"key":"R8","first-page":"329","volume":"94","author":"Kazemi","year":"2014","journal-title":"Util. Math."},{"key":"R9","first-page":"57","volume":"4","author":"Kazemi","year":"2015","journal-title":"Trans. Comb."},{"key":"R10","first-page":"129","volume":"103","author":"Kazemi","year":"2017","journal-title":"Util. Math."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"Kazemi A.P., Kazemnejad F. and Moradi S., Total dominator total coloring of a graph. Contrib. Discrete Math. (2022).","DOI":"10.1142\/S1793830922500768"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"Kazemi A.P., Kazemnejad F. and Moradi S., Total mixed domination in graphs. AKCE Int. J. Graph Theory Combin. (2022).","DOI":"10.1080\/09728600.2022.2111240"},{"key":"R13","first-page":"45","volume":"155","author":"Kazemnejad","year":"2021","journal-title":"Ars Comb."},{"key":"R14","unstructured":"West D.B., Introduction to Graph Theory, 2nd ed. Prentice hall, USA (2001)."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022183\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,15]],"date-time":"2023-03-15T09:11:00Z","timestamp":1678871460000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2022183"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":14,"journal-issue":{"issue":"2"},"alternative-id":["ro220278"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2022183","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"2804-7303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3]]}}}