{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:14:10Z","timestamp":1768317250407,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319530062","type":"print"},{"value":"9783319530079","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_30","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"344-355","source":"Crossref","is-referenced-by-count":7,"title":["A Lower Bound of the cd-Chromatic Number and Its Complexity"],"prefix":"10.1007","author":[{"given":"M. A.","family":"Shalu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Vijayakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. P.","family":"Sandhya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/MPAE.2005.1507024","volume":"3","author":"SM Amin","year":"2005","unstructured":"Amin, S.M., Wollenberg, B.F.: Toward a smart grid. IEEE Power Energy Mag. 3, 34\u201341 (2005)","journal-title":"IEEE Power Energy Mag."},{"key":"30_CR2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/1041680.1041681","volume":"36","author":"S Androutsellis-Theotokis","year":"2004","unstructured":"Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. ACM Comput. Surv. 36, 335\u2013371 (2004)","journal-title":"ACM Comput. Surv."},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Arumugam, S., Chandrasekar, K.R., Misra, N., Philip, G., Saurabh, S.: Algorithmic aspects of dominator colorings in graphs. In: Combinatorial Algorithms, pp. 19\u201330 (2011)","DOI":"10.1007\/978-3-642-25011-8_2"},{"key":"30_CR4","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1109\/TMC.2009.134","volume":"9","author":"C Canali","year":"2010","unstructured":"Canali, C., Renda, M.E., Santi, P., Burresi, S.: Enabling efficient peer-to-peer resource sharing in wireless mesh networks. IEEE Trans. Mob. Comput. 9, 333\u2013347 (2010)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"30_CR5","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2478\/v10209-011-0012-y","volume":"37","author":"P Formanowicz","year":"2012","unstructured":"Formanowicz, P., Tana\u015b, K.: A survey of graph coloring - its types, methods and applications. Found. Comput. Decis. Sci. 37, 223\u2013238 (2012)","journal-title":"Found. Comput. Decis. Sci."},{"key":"30_CR6","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1990)"},{"key":"30_CR7","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1, 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"key":"30_CR8","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."},{"key":"30_CR9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u0227stad","year":"1999","unstructured":"H\u0227stad, J.: Clique is hard to approximate within $$n^{1-\\epsilon }$$ n 1 - \u03f5 . Acta Math. 182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"30_CR10","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":"30_CR11","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating $$k$$ k -set packing. Comput. Complex. 15, 20\u201339 (2006)","journal-title":"Comput. Complex."},{"key":"30_CR12","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":"30_CR13","unstructured":"Krithika, R., Rai, A., Saurabh, S., Tale, P.: Parameterized and Exact Algorithms for Class Domination Coloring. http:\/\/www.imsc.res.in\/~ashutosh\/papers\/cd_coloring.pdf (manuscript)"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-24629-9_4","volume-title":"Databases, Information Systems, and Peer-to-Peer Computing","author":"A L\u00f6ser","year":"2004","unstructured":"L\u00f6ser, A., Naumann, F., Siberski, W., Nejdl, W., Thaden, U.: Semantic overlay clusters within super-peer networks. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds.) DBISP2P 2003. LNCS, vol. 2944, pp. 33\u201347. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-24629-9_4"},{"issue":"4","key":"30_CR15","doi-asserted-by":"crossref","first-page":"677","DOI":"10.7151\/dmgt.1635","volume":"32","author":"HB Merouane","year":"2012","unstructured":"Merouane, H.B., Chellali, M.: On the dominator colorings in trees. Discuss. Math. Gr. Theory 32(4), 677\u2013683 (2012)","journal-title":"Discuss. Math. Gr. Theory"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Micali, S., Vazirani, V.V.: An $$O(\\sqrt{\\left|V\\right|}\\left|E \\right|)$$ O ( V E ) algorithm for finding maximum matchings in general graphs. In: Proceedings of the 21st IEEE Symposium on Foundations of Computer Science, pp. 17\u201327 (1980)","DOI":"10.1109\/SFCS.1980.12"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Monti, A., Ponci, F., Benigni, A., Liu, J.: Distributed intelligence for smart grid control. In: International School on Nonsinusoidal Currents and Compensation, 15\u201318 June 2010, \u0141ag\u00f3w, Poland (2010)","DOI":"10.1109\/ISNCC.2010.5524469"},{"key":"30_CR18","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on the stable sets and coloring of graphs. Commun. Math. Univ. Carolin. 15, 307\u2013309 (1974)","journal-title":"Commun. Math. Univ. Carolin."},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-319-29221-2_29","volume-title":"Algorithms Discret. Appl. Math.","author":"MA Shalu","year":"2016","unstructured":"Shalu, M.A., Sandhya, T.P.: The cd-coloring of graphs. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 337\u2013348. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-29221-2_29"},{"key":"30_CR20","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 Discret. Math. 18, 301\u2013305 (2014)","journal-title":"Algebra Discret. Math."},{"key":"30_CR21","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-53007-9_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T01:39:18Z","timestamp":1568770758000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}