{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T12:05:53Z","timestamp":1768305953890,"version":"3.49.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031522123","type":"print"},{"value":"9783031522130","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-52213-0_17","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"239-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Open Packing in\u00a0H-free Graphs and\u00a0Subclasses of\u00a0Split Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4399-0791","authenticated-orcid":false,"given":"M. A.","family":"Shalu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3057-457X","authenticated-orcid":false,"given":"V. K.","family":"Kirubakaran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0166-218X(84)90088-X","volume":"9","author":"DG Corneil","year":"1984","unstructured":"Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discret. Appl. Math. 9(1), 27\u201339 (1984). https:\/\/doi.org\/10.1016\/0166-218X(84)90088-X","journal-title":"Discret. Appl. Math."},{"key":"17_CR2","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, 1st edn. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3","edition":"1"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"31","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P., Muller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inf. Process. Lett. 31, 231\u2013236 (1990). https:\/\/doi.org\/10.1016\/0020-0190(90)90147-P","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"RG Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II: on completeness for W[1]. Theoret. Comput. Sci. 141(1), 109\u2013131 (1995). https:\/\/doi.org\/10.1016\/0304-3975(94)00097-3","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2016","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, London (2016). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stard","year":"1999","unstructured":"H\u00e5stard, J.: Clique is hard to approximate within $$n^{1-\\epsilon }$$. Acta Math. 182, 105\u2013142 (1999). https:\/\/doi.org\/10.1007\/BF02392825","journal-title":"Acta Math."},{"key":"17_CR7","doi-asserted-by":"publisher","DOI":"10.1201\/9781482246582","volume-title":"Fundamentals of Domination in Graphs","author":"TW Haynes","year":"1998","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs, 1st edn. CRC Press, Boca Raton (1998). https:\/\/doi.org\/10.1201\/9781482246582","edition":"1"},{"issue":"1","key":"17_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0012-365X(97)00228-8","volume":"186","author":"MA Henning","year":"1998","unstructured":"Henning, M.A.: Packing in trees. Discret. Math. 186(1), 145\u2013155 (1998). https:\/\/doi.org\/10.1016\/S0012-365X(97)00228-8","journal-title":"Discret. Math."},{"key":"17_CR9","first-page":"3","volume":"29","author":"MA Henning","year":"1999","unstructured":"Henning, M.A., Slater, P.J.: Open packing in graphs. J. Comb. Math. Comb. Comput. 29, 3\u201316 (1999)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"17_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs","author":"MA Henning","year":"2015","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, New York (2015). https:\/\/doi.org\/10.1007\/978-1-4614-6525-6"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","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., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Springer, Cham (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"key":"17_CR12","unstructured":"McRae, A.A.: Generalizing NP-completeness proofs for bipartite graphs and chordal graphs. Ph.D. thesis, Clemson University, USA (1995)"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.7151\/dmgt.1257","volume":"25","author":"DF Rall","year":"2005","unstructured":"Rall, D.F.: Total domination in categorical products of graphs. Discussiones Mathematicae Graph Theory 25, 35\u201344 (2005). https:\/\/doi.org\/10.7151\/dmgt.1257","journal-title":"Discussiones Mathematicae Graph Theory"},{"key":"17_CR14","doi-asserted-by":"publisher","unstructured":"Ramos, I., Santos, V.F., Szwarcfiter, J.L.: Complexity aspects of the computation of the rank of a graph. Discrete Math. Theor. Comput. Sci. 16 (2014). https:\/\/doi.org\/10.46298\/dmtcs.2075","DOI":"10.46298\/dmtcs.2075"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.dam.2018.05.050","volume":"280","author":"P Renjith","year":"2020","unstructured":"Renjith, P., Sadagopan, N.: The steiner tree in $$ {K}_{1, r}$$-free split graphs-a dichotomy. Discret. Appl. Math. 280, 246\u2013255 (2020). https:\/\/doi.org\/10.1016\/j.dam.2018.05.050","journal-title":"Discret. Appl. Math."},{"key":"17_CR16","unstructured":"Shalu, M.A., Kirubakaran, V.K.: Total domination number and its lower bound in some subclasses of bipartite graphs. Manusript-UnderReview (2023)"},{"key":"17_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-319-53007-9_30","volume-title":"Algorithms and Discrete Applied Mathematics","author":"MA Shalu","year":"2017","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.) CALDAM 2017. LNCS, vol. 10156, pp. 344\u2013355. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53007-9_30"},{"key":"17_CR18","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2018","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson, London (2018)","edition":"2"},{"issue":"1","key":"17_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230150109","volume":"15","author":"K White","year":"1985","unstructured":"White, K., Farber, M., Pulleyblank, W.: Steiner trees, connected domination and strongly chordal graphs. Networks 15(1), 109\u2013124 (1985). https:\/\/doi.org\/10.1002\/net.3230150109","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52213-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:20Z","timestamp":1768281740000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_17","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":"14 January 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhilai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"15 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.iitbhilai.ac.in\/caldam2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}