{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:18Z","timestamp":1770972378448,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031555978","type":"print"},{"value":"9783031555985","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-55598-5_7","type":"book-chapter","created":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T18:01:53Z","timestamp":1709661713000},"page":"97-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Total Domination, Separated-Cluster, CD-Coloring: Algorithms and\u00a0Hardness"],"prefix":"10.1007","author":[{"given":"Dhanyamol","family":"Antony","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L. Sunil","family":"Chandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit","family":"Gayen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shirish","family":"Gosavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dalu","family":"Jacob","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annals Math. 164(1), 51\u2013229 (2006)","DOI":"10.4007\/annals.2006.164.51"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s00373-014-1407-3","volume":"31","author":"HB Merouane","year":"2015","unstructured":"Merouane, H.B., Haddad, M., Chellali, M., Kheddouci, H.: Dominated colorings of graphs. Graphs Comb. 31(3), 713\u2013727 (2015)","journal-title":"Graphs Comb."},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.dam.2018.03.004","volume":"280","author":"MA Shalu","year":"2020","unstructured":"Shalu, M.A., Vijayakumar, S., Sandhya, T.P.: On the complexity of cd-coloring of graphs. Discret. Appl. Math. 280, 171\u2013185 (2020)","journal-title":"Discret. Appl. Math."},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Shalu, M.A., Kirubakaran, V.K.: On cd-coloring of trees and co-bipartite graphs. In: Mudgal, A., Subramanian, C.R. (eds.) CALDAM 2021. LNCS, vol. 12601, pp. 209\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67899-9_16","DOI":"10.1007\/978-3-030-67899-9_16"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Banik, A., Kasthurirangan, P.N., Raman, V.: Dominator coloring and CD coloring in almost cluster graphs. In: Morin, P., Suri, S. (eds.) WADS 2023. LNCS, vol. 14079, pp. 106\u2013119. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38906-1_8","DOI":"10.1007\/978-3-031-38906-1_8"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1016\/j.dam.2020.12.015","volume":"291","author":"R Krithika","year":"2021","unstructured":"Krithika, R., Rai, A., Saurabh, S., Tale, P.: Parameterized and exact algorithms for class domination coloring. Discret. Appl. Math. 291, 286\u2013299 (2021)","journal-title":"Discret. Appl. Math."},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Chen, Y.H.: The dominated coloring problem and its application. In: Murgante, B., et al. (eds.) ICCSA 2014. LNCS, vol. 8584, pp. 132\u2013145. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09153-2_10","DOI":"10.1007\/978-3-319-09153-2_10"},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2020.125647","volume":"390","author":"S Klav\u017ear","year":"2021","unstructured":"Klav\u017ear, S., Tavakoli, M.: Dominated and dominator colorings over (edge) corona and hierarchical products. Appl. Math. Comput. 390, 125647 (2021)","journal-title":"Appl. Math. Comput."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Hoppen, C., Mansan, G.: Total domination in regular graphs. Electron. Notes Theor. Comput. Sci. 346, 523\u2013533 (2019)","DOI":"10.1016\/j.entcs.2019.08.046"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-6525-6"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Zhu, J.: Approximation for minimum total dominating set. In: ICIS (2009)","DOI":"10.1145\/1655925.1655948"},{"issue":"1\u20132","key":"7_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.dam.2004.01.007","volume":"144","author":"R Shamir","year":"2004","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. Discret. Appl. Math. 144(1\u20132), 173\u2013182 (2004)","journal-title":"Discret. Appl. Math."},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Shalu, M.A., Vijayakumar, S., Sandhya, T.P.: A lower bound of the cd-chromatic number and its complexity. In: Gaur, D., Narayanaswamy, N.S. (eds.) Algorithms and Discrete Applied Mathematics. LNCS, vol. 10156, pp. 344\u2013355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53007-9_30","DOI":"10.1007\/978-3-319-53007-9_30"},{"issue":"1\u20133","key":"7_CR14","doi-asserted-by":"publisher","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. Discret. Math. 274(1\u20133), 1\u20138 (2004)","journal-title":"Discret. Math."},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","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(1), 97\u2013107 (2012)","journal-title":"Graphs Comb."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Mycielski, J.: Sur le coloriage des graphs. In: Colloquium Mathematicae (1955)","DOI":"10.4064\/cm-3-2-161-162"},{"key":"7_CR17","unstructured":"Shalu, M.A., Kirubakaran, V.K.: On cd-coloring of $${\\rm P}_{5}$$,$${\\rm K}_{4}$$-free chordal graphs. In: CALDAM (2022)"},{"key":"7_CR18","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (2000)"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"5","key":"7_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P., M\u00fcller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inf. Process. Lett. 36(5), 231\u2013236 (1990)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"7_CR21","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.akcej.2016.02.007","volume":"13","author":"S Paul","year":"2016","unstructured":"Paul, S., Pal, M., Pal, A.: A linear time algorithm to compute square of interval graphs and their colouring. AKCE Int. J. Graphs Comb. 13(1), 54\u201364 (2016)","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Kr\u00e1l\u2019, D., Kratochv\u00edl, J., Tuza, Z., Woeginger, G.J.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandst\u00e4dt, A., Le, V.B. (eds.) Graph-Theoretic Concepts in Computer Science, pp. 254\u2013262. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45477-2_23","DOI":"10.1007\/3-540-45477-2_23"},{"key":"7_CR23","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. In: Commentationes Mathematicae Universitatis Carolinae, pp. 307\u2013309 (1974)"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2020.12.001","volume":"858","author":"N Chiarelli","year":"2021","unstructured":"Chiarelli, N., Mart\u00ednez-Barona, B., Milani\u010d, M., Monnot, J., Mur\u0161i\u010d, P.: Strong cliques in diamond-free graphs. Theoret. Comput. Sci. 858, 49\u201363 (2021)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","LATIN 2024: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-55598-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T18:02:30Z","timestamp":1709661750000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-55598-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031555978","9783031555985"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-55598-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"6 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puerto Varas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/latin2024.cmm.uchile.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}