{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:04Z","timestamp":1780783144539,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_7","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:13:55Z","timestamp":1780780435000},"page":"88-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hardness Results on\u00a0Bondage and\u00a0Reinforcement Problems in\u00a0Chordal Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-8505-759X","authenticated-orcid":false,"given":"Deepak M.","family":"Bakal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0729-5433","authenticated-orcid":false,"given":"Y. M.","family":"Borse","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"7_CR2","unstructured":"Bakal, D.M., Borse, Y.M., Waphare, B.N.: Algorithmic complexity of three domination subdivision number problems in graphs. Commun. Comb. Optim. (2025)"},{"issue":"2\u20133","key":"7_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0012-365X(83)90085-7","volume":"47","author":"D Bauer","year":"1983","unstructured":"Bauer, D., Harary, F., Nieminen, J., Suffel, C.L.: Domination alteration sets in graphs. Discrete Math. 47(2\u20133), 153\u2013161 (1983)","journal-title":"Discrete Math."},{"key":"7_CR4","unstructured":"Bouquet, V.: The complexity of the bondage problem in planar graphs. arXiv preprint arXiv:2107.11216 (2021)"},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33(2), 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015)","DOI":"10.1007\/978-3-319-21275-3"},{"issue":"15","key":"7_CR7","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1016\/j.dam.2010.06.003","volume":"158","author":"WJ Desormeaux","year":"2010","unstructured":"Desormeaux, W.J., Haynes, T.W., Henning, M.A.: Total domination critical and stable graphs upon edge removal. Discrete Appl. Math. 158(15), 1587\u20131592 (2010)","journal-title":"Discrete Appl. Math."},{"issue":"24","key":"7_CR8","doi-asserted-by":"publisher","first-page":"3446","DOI":"10.1016\/j.disc.2010.08.006","volume":"310","author":"WJ Desormeaux","year":"2010","unstructured":"Desormeaux, W.J., Haynes, T.W., Henning, M.A.: Total domination stable graphs upon edge addition. Discrete Math. 310(24), 3446\u20133454 (2010)","journal-title":"Discrete Math."},{"issue":"4","key":"7_CR9","doi-asserted-by":"publisher","first-page":"829","DOI":"10.7151\/dmgt.2103","volume":"39","author":"M Dettlaff","year":"2019","unstructured":"Dettlaff, M., Raczek, J., Topp, J.: Domination subdivision and domination multisubdivision numbers of graphs. Discuss. Math. Graph Theory 39(4), 829\u2013839 (2019)","journal-title":"Discuss. Math. Graph Theory"},{"issue":"1\u20133","key":"7_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(90)90348-L","volume":"86","author":"JF Fink","year":"1990","unstructured":"Fink, J.F., Jacobson, M.S., Kinch, L.F., Roberts, J.: The bondage number of a graph. Discrete Math. 86(1\u20133), 47\u201357 (1990)","journal-title":"Discrete Math."},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.112169","volume":"344","author":"E Galby","year":"2021","unstructured":"Galby, E., Lima, P.T., Ries, B.: Reducing the domination number of graphs via edge contractions and vertex deletions. Discrete Math. 344(1), 112169 (2021)","journal-title":"Discrete Math."},{"key":"7_CR12","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., San Francisco (1979)"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/s00224-016-9685-1","volume":"60","author":"F Gurski","year":"2017","unstructured":"Gurski, F.: The behavior of clique-width under graph operations and graph transformations. Theory Comput. Syst. 60(2), 346\u2013376 (2017)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"7_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.7151\/dmgt.1126","volume":"20","author":"TW Haynes","year":"2000","unstructured":"Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T.: Domination and independence subdivision numbers of graphs. Discuss. Math. Graph Theory 20(2), 271\u2013280 (2000)","journal-title":"Discuss. Math. Graph Theory"},{"key":"7_CR15","series-title":"Springer Monographs in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-09496-5","volume-title":"Domination in Graphs: Core Concepts","author":"TW Haynes","year":"2023","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Domination in Graphs: Core Concepts. Springer Monographs in Mathematics, Springer, Cham (2023)"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.tcs.2014.04.005","volume":"535","author":"FT Hu","year":"2014","unstructured":"Hu, F.T., Sohn, M.Y.: The algorithmic complexity of bondage and reinforcement problems in bipartite graphs. Theoret. Comput. Sci. 535, 46\u201353 (2014)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.jco.2011.11.001","volume":"28","author":"FT Hu","year":"2012","unstructured":"Hu, F.T., Xu, J.M.: On the complexity of the bondage and reinforcement problems. J. Complexity 28(2), 192\u2013201 (2012)","journal-title":"J. Complexity"},{"key":"7_CR18","first-page":"431","volume":"94","author":"J Huang","year":"2010","unstructured":"Huang, J., Xu, J.M.: Domination and total domination contraction numbers of graphs. Ars Combin. 94, 431\u2013443 (2010)","journal-title":"Ars Combin."},{"key":"7_CR19","first-page":"225","volume":"79","author":"J Kok","year":"1990","unstructured":"Kok, J., Mynhardt, C.M.: Reinforcement in graphs. Congr. Numer. 79, 225\u2013231 (1990)","journal-title":"Congr. Numer."},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"issue":"7","key":"7_CR21","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1016\/j.disc.2007.03.067","volume":"308","author":"JRS Blair","year":"2008","unstructured":"Blair, J.R.S., Goddard, W., Hedetniemi, S.T., Horton, S., Jones, P., Kubicki, G.: On domination and reinforcement numbers in trees. Discrete Math. 308(7), 1165\u20131175 (2008)","journal-title":"Discrete Math."},{"issue":"8\u20139","key":"7_CR22","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.disc.2006.02.008","volume":"306","author":"K Carlson","year":"2006","unstructured":"Carlson, K., Develin, M.: On the bondage number of planar and directed graphs. Discrete Math. 306(8\u20139), 820\u2013826 (2006)","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"7_CR23","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.disc.2004.12.019","volume":"303","author":"L Kang","year":"2005","unstructured":"Kang, L., Sohn, M.Y., Kim, H.K.: Bondage number of the discrete torus $$C_n \\times C_4$$. Discrete Math. 303(1\u20133), 80\u201386 (2005)","journal-title":"Discrete Math."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.dam.2017.06.019","volume":"230","author":"W Zhao","year":"2017","unstructured":"Zhao, W., Wang, F., Gao, X., Li, H.: Bondage number of the strong product of two trees. Discrete Appl. Math. 230, 133\u2013145 (2017)","journal-title":"Discrete Appl. Math."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/S0012-365X(97)00232-X","volume":"167","author":"GS Domke","year":"1997","unstructured":"Domke, G.S., Laskar, R.C.: The bondage and reinforcement numbers of $$\\gamma _f$$ for some graphs. Discrete Math. 167, 249\u2013259 (1997)","journal-title":"Discrete Math."},{"key":"7_CR26","unstructured":"Bouquet, V.: The bondage number of chordal graphs. arXiv preprint arXiv:2203.09256 (2022)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:13:59Z","timestamp":1780780439000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}