{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T03:42:45Z","timestamp":1780544565817,"version":"3.54.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,24]],"date-time":"2013-05-24T00:00:00Z","timestamp":1369353600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10878-013-9631-y","type":"journal-article","created":{"date-parts":[[2013,5,23]],"date-time":"2013-05-23T08:20:10Z","timestamp":1369297210000},"page":"27-33","source":"Crossref","is-referenced-by-count":8,"title":["An algorithm for the dominator chromatic number of a tree"],"prefix":"10.1007","volume":"30","author":[{"given":"Houcine","family":"Boumediene Merouane","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mustapha","family":"Chellali","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,5,24]]},"reference":[{"key":"9631_CR1","first-page":"19","volume":"LNCS 7056","author":"S Arumugam","year":"2011","unstructured":"Arumugam S, Raja Chandrasekar K, Misra N, Geevarghese P, Saurabh S (2011) Algorithmic Aspects of Dominator Colorings in Graphs. IWOCA 2011 LNCS 7056:19\u201330","journal-title":"IWOCA 2011"},{"key":"9631_CR2","doi-asserted-by":"crossref","first-page":"677","DOI":"10.7151\/dmgt.1635","volume":"32","author":"H Boumediene Merouane","year":"2012","unstructured":"Boumediene Merouane H, Chellali M (2012) On the dominator colorings in trees. Discussiones Mathematicae Graph Theory 32:677\u2013683","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"9631_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s00373-010-1012-z","volume":"28","author":"M Chellali","year":"2012","unstructured":"Chellali M, Maffray F (2012) Dominator colorings in some classes of graphs. Graphs Combinatorics 28:97\u2013107","journal-title":"Graphs Combinatorics"},{"key":"9631_CR4","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF01934098","volume":"28","author":"GH Chen","year":"1988","unstructured":"Chen GH, Kuo MT, Sheu JP (1988) An optimal time algorithm for finding a maximum weight independent set in tree. BIT Numer Math 28:353\u2013356","journal-title":"BIT Numer Math"},{"key":"9631_CR5","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0190(75)90011-3","volume":"4","author":"E Cockayne","year":"1975","unstructured":"Cockayne E, Goodman S, Hedetniemi ST (1975) A linear algorithm for the domination number of a tree. Inf Process Lett 4:41\u201344","journal-title":"Inf Process Lett"},{"key":"9631_CR6","first-page":"19","volume":"181","author":"R Gera","year":"2006","unstructured":"Gera R, Horton S, Rasmussen C (2006) Dominator colorings and safe clique partitions. Congressus Numerantium 181:19\u201332","journal-title":"Congressus Numerantium"},{"key":"9631_CR7","doi-asserted-by":"crossref","unstructured":"Gera R (2007a) On the dominator colorings in bipartite graphs. In: Information Technology: New Generations, pp 947\u2013952","DOI":"10.1109\/ITNG.2007.142"},{"key":"9631_CR8","doi-asserted-by":"crossref","unstructured":"Gera R (2007b) On dominator colorings in graphs. Graph Theory Notes of New York LII 2007:25\u201330","DOI":"10.1109\/ITNG.2007.142"},{"key":"9631_CR9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(94)90110-4","volume":"51","author":"L Volkmann","year":"1994","unstructured":"Volkmann L (1994) On graphs with equal domination and covering numbers. Discret Appl Math 51:211\u2013217","journal-title":"Discret Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9631-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9631-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9631-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T22:19:15Z","timestamp":1563056355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9631-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,24]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9631"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9631-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,24]]}}}