{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:19Z","timestamp":1759063759725,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319292205"},{"type":"electronic","value":"9783319292212"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-29221-2_29","type":"book-chapter","created":{"date-parts":[[2016,2,12]],"date-time":"2016-02-12T12:02:54Z","timestamp":1455278574000},"page":"337-348","source":"Crossref","is-referenced-by-count":7,"title":["The cd-Coloring of Graphs"],"prefix":"10.1007","author":[{"given":"M. A.","family":"Shalu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. P.","family":"Sandhya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-642-25011-8_2","volume-title":"Combinatorial Algorithms","author":"S Arumugam","year":"2011","unstructured":"Arumugam, S., Chandrasekar, K.R., Misra, N., Philip, G., Saurabh, S.: Algorithmic aspects of dominator colorings in graphs. In: Iliopoulos, C.S., Smyth, W.F. (eds.) Combinatorial Algorithms. LNCS, vol. 7056, pp. 19\u201330. Springer, Heidelberg (2011)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B Aspvall","year":"1979","unstructured":"Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified Boolean formulas. Inf. Process. Lett. 8, 121\u2013123 (1979)","journal-title":"Inf. Process. Lett."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/jgt.3190110405","volume":"11","author":"V Chv\u00e1tal","year":"1987","unstructured":"Chv\u00e1tal, V., Ho\u00e0ng, C.T., Mahadev, N.V.R., de Werra, D.: Four classes of perfectly orderable graphs. J. Graph Theory 11, 481\u2013495 (1987)","journal-title":"J. Graph Theory"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Feder, T., Hell, P., Klein, S., Motwani, R.: Complexity of graph partition problems. In: Proceedings of the 31st Annual ACM STOC, pp. 464\u2013472 (1999)","DOI":"10.1145\/301250.301373"},{"key":"29_CR5","first-page":"19","volume":"181","author":"R Gera","year":"2006","unstructured":"Gera, R., Horton, S., Rasmussen, C.: Dominator colorings and safe clique partitions. Congressus Numerantium 181, 19\u201332 (2006)","journal-title":"Congressus Numerantium"},{"key":"29_CR6","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations. Plenum Press, New York (1972)"},{"key":"29_CR7","volume-title":"Color Class Domination in Graphs: Mathematical and Experimental Physics","author":"V Swaminathan","year":"2010","unstructured":"Swaminathan, V., Sundareswaran, R.: Color Class Domination in Graphs: Mathematical and Experimental Physics. Narosa Publishing house, New Delhi (2010)"},{"key":"29_CR8","first-page":"233","volume":"12","author":"YB Venkatakrishnan","year":"2010","unstructured":"Venkatakrishnan, Y.B., Swaminathan, V.: Color class domination number of middle graph and center graph of \n                    \n                      \n                    \n                    $$K_{1, n}, C_n, P_n$$\n                  . Adv. Model. Optim. 12, 233\u2013237 (2010)","journal-title":"Adv. Model. Optim."},{"key":"29_CR9","first-page":"301","volume":"18","author":"YB Venkatakrishnan","year":"2014","unstructured":"Venkatakrishnan, Y.B., Swaminathan, V.: Color class domination numbers of some classes of graphs. Algebra Discrete Math. 18, 301\u2013305 (2014)","journal-title":"Algebra Discrete Math."},{"key":"29_CR10","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, USA (2000)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29221-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:24:06Z","timestamp":1559384646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29221-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319292205","9783319292212"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29221-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}