{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:35:24Z","timestamp":1720658124145},"reference-count":6,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T00:00:00Z","timestamp":1614643200000},"content-version":"vor","delay-in-days":60,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2020,10,24]]},"published-print":{"date-parts":[[2021]]},"abstract":"<jats:p>A dominator coloring is a proper coloring of the vertices of a graph such that each vertex of the graph dominates all vertices of at least one color class (possibly its own class). The dominator chromatic number of a graph <jats:italic>G<\/jats:italic> is the minimum number of color classes in a dominator coloring of <jats:italic>G<\/jats:italic>. In this paper, we determine the exact value of the dominator chromatic number of a subclass of forests which we call, generalized caterpillars forest, where every vertex of degree at least three is a support vertex.<\/jats:p>","DOI":"10.1051\/ro\/2020122","type":"journal-article","created":{"date-parts":[[2020,10,27]],"date-time":"2020-10-27T09:39:34Z","timestamp":1603791574000},"page":"S1647-S1655","source":"Crossref","is-referenced-by-count":0,"special_numbering":"Supplement","title":["On the dominator chromatic number of the generalized caterpillars forest"],"prefix":"10.1051","volume":"55","author":[{"given":"Soumia","family":"Aioula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mustapha","family":"Chellali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noureddine","family":"Ikhlef-Eschouf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,3,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"677","DOI":"10.7151\/dmgt.1635","volume":"32","author":"Boumediene Merouane","year":"2012","journal-title":"Discuss Math. Graph Theory"},{"key":"R2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10878-013-9631-y","volume":"30","author":"Boumediene Merouane","year":"2015","journal-title":"J. Combin. Optim"},{"key":"R3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00373-010-1012-z","volume":"28","author":"Chellali","year":"2012","journal-title":"Graphs Combin"},{"key":"R4","first-page":"25","volume":"52","author":"Gera","year":"2007","journal-title":"Graph Theory Notes New York"},{"key":"R5","unstructured":"Gera R., On the dominator colorings in bipartite graphs. In: Proceedings of the 4th International Conference on Information Technology: New Generations (ITNG) (2007) 947\u2013952."},{"key":"R6","first-page":"19","volume":"181","author":"Gera","year":"2006","journal-title":"Congr. Numer"}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020122\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,2]],"date-time":"2021-03-02T09:22:52Z","timestamp":1614676972000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2020122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":6,"alternative-id":["ro200139"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2020122","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}