{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:09Z","timestamp":1759639089733,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031095733"},{"type":"electronic","value":"9783031095740"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09574-0_2","type":"book-chapter","created":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T17:36:07Z","timestamp":1656005767000},"page":"17-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Coloring a\u00a0Dominating Set Without Conflicts: q-Subset Square Coloring"],"prefix":"10.1007","author":[{"given":"V. P.","family":"Abidha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pradeesha","family":"Ashok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avi","family":"Tomar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dolly","family":"Yadav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,24]]},"reference":[{"key":"2_CR1","first-page":"189","volume":"189","author":"DW Bange","year":"1988","unstructured":"Bange, D.W.: Efficient dominating sets in graphs. Appl. Discrete Math. 189, 189\u2013199 (1988)","journal-title":"Appl. Discrete Math."},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19(1), 37\u201340 (1984)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A c$$\\wedge $$kn 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s10878-011-9409-z","volume":"24","author":"B Yuehua","year":"2012","unstructured":"Yuehua, B., Zhu, X.: An optimal square coloring of planar graphs. J. Comb. Optim. 24(4), 580\u2013592 (2012)","journal-title":"J. Comb. Optim."},{"issue":"5","key":"2_CR5","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1093\/comjnl\/bxl018","volume":"49","author":"T Calamoneri","year":"2006","unstructured":"Calamoneri, T.: The l (h, k)-labelling problem: a survey and annotated bibliography. Comput. J. 49(5), 585\u2013608 (2006)","journal-title":"Comput. J."},{"key":"2_CR6","volume-title":"Chromatic Graph Theory","author":"G Chartrand","year":"2008","unstructured":"Chartrand, G., Zhang, P.: Chromatic Graph Theory. Chapman and Hall\/CRC, London (2008)"},{"issue":"3","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3310228","volume":"15","author":"D Coudert","year":"2019","unstructured":"Coudert, D., Ducoffe, G., Popa, A.: Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. ACM Trans. Algorithms (TALG) 15(3), 1\u201357 (2019)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"2_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms, vol. 5. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"2_CR9","unstructured":"Erickson, L., LaValle, S.M.: A chromatic art gallery problem. Technical report (2010)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-03898-8_15","volume-title":"Parameterized and Exact Computation","author":"J Gajarsk\u00fd","year":"2013","unstructured":"Gajarsk\u00fd, J., Lampis, M., Ordyniak, S.: Parameterized algorithms for modular-width. In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 163\u2013176. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_15"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Ganian, R.: Improving vertex cover as a graph parameter. Discrete Math. Theor. Comput. Sci. 17 (2015)","DOI":"10.46298\/dmtcs.2136"},{"key":"2_CR12","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences), 1st edn. W. H. Freeman, New York (1979)"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.tcs.2014.11.029","volume":"566","author":"L Gargano","year":"2015","unstructured":"Gargano, L., Rescigno, A.A.: Complexity of conflict-free colorings of graphs. Theoret. Comput. Sci. 566, 39\u201349 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J Griggs","year":"1992","unstructured":"Griggs, J., Yeh, R.: Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5, 586\u2013595 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0604032","volume":"4","author":"J Hopcroft","year":"1983","unstructured":"Hopcroft, J., Krishnamoorthy, M.: On the harmonious coloring of graphs. SIAM J. Algebraic Discrete Methods 4, 306\u2013311 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-03898-8_22","volume-title":"Parameterized and Exact Computation","author":"D Lokshtanov","year":"2013","unstructured":"Lokshtanov, D., Misra, N., Philip, G., Ramanujan, M.S., Saurabh, S.: Hardness of r-dominating set on graphs of diameter (r+1). In: Gutin, G., Szeider, S. (eds.) IPEC 2013. LNCS, vol. 8246, pp. 255\u2013267. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-03898-8_22"},{"issue":"3","key":"2_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<213::AID-JGT2>3.0.CO;2-P","volume":"22","author":"G MacGillivray","year":"1996","unstructured":"MacGillivray, G., Seyffarth, K.: Domination numbers of planar graphs. J. Graph Theory 22(3), 213\u2013229 (1996)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.dam.2011.10.024","volume":"160","author":"C Ortiz","year":"2012","unstructured":"Ortiz, C., Villanueva, M.: Maximal independent sets in caterpillar graphs. Discret. Appl. Math. 160(3), 259\u2013266 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J Spinrad","year":"1987","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discret. Appl. Math. 18(3), 279\u2013292 (1987)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"2_CR21","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J van den Heuvel","year":"2003","unstructured":"van den Heuvel, J., McGuinness, S.: Coloring the square of a planar graph. J. Graph Theory 42(2), 110\u2013124 (2003)","journal-title":"J. Graph Theory"},{"key":"2_CR22","unstructured":"Wang, Y.L., Lin, T.W., Wang, L.: The local harmonious chromatic problem. In: Proceedings of the 27th Workshop on Combinatorial Mathematices and Computation Theory, Taichung, Taiwan (2010)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09574-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T23:02:59Z","timestamp":1656284579000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09574-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031095733","9783031095740"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09574-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"51","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":"21","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":"41% - 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","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":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","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)"}}]}}