{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T23:25:10Z","timestamp":1780529110575,"version":"3.54.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,16]],"date-time":"2014-03-16T00:00:00Z","timestamp":1394928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1007\/s00373-014-1407-3","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T01:35:27Z","timestamp":1395106527000},"page":"713-727","source":"Crossref","is-referenced-by-count":32,"title":["Dominated Colorings of Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Houcine Boumediene","family":"Merouane","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed","family":"Haddad","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mustapha","family":"Chellali","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hamamache","family":"Kheddouci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,16]]},"reference":[{"issue":"5","key":"1407_CR1","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1090\/S0002-9904-1976-14122-5","volume":"82","author":"K Appel","year":"1976","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. Bull. Am. Math. Soc. 82(5), 711\u2013712 (1976)","journal-title":"Bull. Am. Math. Soc."},{"key":"1407_CR2","doi-asserted-by":"crossref","unstructured":"Arumugam, S., Raja Chandrasekar, K., Misra, N., Geevarghese, P., Saurabh, S.: Algorithmic aspects of dominator colorings in graphs. In: IWOCA\u20192011, LNCS 7056, pp. 19\u201330 (2011)","DOI":"10.1007\/978-3-642-25011-8_2"},{"issue":"4","key":"1407_CR3","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.: On the dominator colorings in trees. Discuss. Math. Graph Theory 32(4), 677\u2013683 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1407_CR4","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.: Dominator colorings in some classes of graphs. Graphs Comb. 28, 97\u2013107 (2012)","journal-title":"Graphs Comb."},{"issue":"1\u20133","key":"1407_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(03)00093-1","volume":"274","author":"M Chellali","year":"2004","unstructured":"Chellali, M., Volkmann, L.: Relations between the lower domination parameters and the chromatic number of a graph. Discrete Math. 274(1\u20133), 1\u20138 (2004)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"1407_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0012-365X(98)00094-6","volume":"191","author":"G Chen","year":"1998","unstructured":"Chen, G., Gyarfas, A., Schelp, R.: Vertex colorings with a distance restriction. Discrete Math. 191(1\u20133), 65\u201382 (1998)","journal-title":"Discrete Math."},{"key":"1407_CR7","doi-asserted-by":"crossref","unstructured":"Gera, R.: On the dominator colorings in bipartite graphs. Inf. Technol. New Gen., 947\u2013952 (2007)","DOI":"10.1109\/ITNG.2007.142"},{"key":"1407_CR8","doi-asserted-by":"crossref","unstructured":"Gera, R.: On dominator colorings in graphs. Graph Theory Notes of New York LII, pp. 25\u201330 (2007)","DOI":"10.1109\/ITNG.2007.142"},{"key":"1407_CR9","first-page":"19","volume":"181","author":"R Gera","year":"2006","unstructured":"Gera, R., Horton, S., Rasmussen, C.: Dominator colorings and safe clique partitions. Congr. Numer. 181, 19\u201332 (2006)","journal-title":"Congr. Numer."},{"issue":"18","key":"1407_CR10","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1016\/j.ipl.2009.06.012","volume":"109","author":"M Haddad","year":"2009","unstructured":"Haddad, M., Kheddouci, H.: A strict strong coloring of trees. Inf. Process. Lett. 109(18), 1047\u20131054 (2009)","journal-title":"Inf. Process. Lett."},{"key":"1407_CR11","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Marcel Dekker, New York (1998)"},{"key":"1407_CR12","volume-title":"Domination in Graphs: Advanced Topics","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Domination in Graphs: Advanced Topics. Marcel Dekker, New York (1998)"},{"issue":"3","key":"1407_CR13","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/0605040","volume":"5","author":"R Laskar","year":"1984","unstructured":"Laskar, R., Pfaff, J., Hedetniemi, S.M., Hedetniemi, S.T.: On the algorithmic complexity of total domination. SIAM J. Alg. Discrete Methods 5(3), 420\u2013425 (1984)","journal-title":"SIAM J. Alg. Discrete Methods"},{"key":"1407_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E Malaguti","year":"2010","unstructured":"Malaguti, E., Toth, P.: A survey on vertex coloring problems. Int. Trans. Oper. Res. 17, 1\u201334 (2010)","journal-title":"Int. Trans. Oper. Res."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1407-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1407-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1407-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T11:06:08Z","timestamp":1565262368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1407-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,16]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,5]]}},"alternative-id":["1407"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1407-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,16]]}}}