{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T22:47:54Z","timestamp":1767134874819,"version":"3.48.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031252105"},{"type":"electronic","value":"9783031252112"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-25211-2_17","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T19:02:42Z","timestamp":1674673362000},"page":"219-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Short Cycles Dictate Dichotomy Status of\u00a0the\u00a0Steiner Tree Problem on\u00a0Bisplit Graphs"],"prefix":"10.1007","author":[{"given":"A.","family":"Mohanapriya","sequence":"first","affiliation":[]},{"given":"P.","family":"Renjith","sequence":"additional","affiliation":[]},{"given":"N.","family":"Sadagopan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Hammer, P.L., Lozin, V.V., et al.: Bisplit graphs. Discrete Math. 299(1\u20133), 11\u201332 (2005)","DOI":"10.1016\/j.disc.2004.08.046"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Abueida, A., Sritharan, R.: A note on the recognition of bisplit graphs. Discret. Math. 306(17), 2108\u20132110 (2006)","DOI":"10.1016\/j.disc.2006.04.001"},{"issue":"1","key":"17_CR3","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)","journal-title":"Networks"},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","volume":"156","author":"H M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: Hamiltonian circuits in chordal bipartite graphs. Discret. Math. 156(1), 291\u2013298 (1996)","journal-title":"Discret. Math."},{"issue":"14","key":"17_CR5","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.ipl.2013.05.001","volume":"113","author":"J Mark Keil","year":"2013","unstructured":"Mark Keil, J., Pradhan, D.: Computing a minimum outer-connected dominating set for the class of chordal graphs. Inf. Process. Lett. 113(14), 552\u2013561 (2013)","journal-title":"Inf. Process. Lett."},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-319-53007-9_28","volume-title":"Algorithms and Discrete Applied Mathematics","author":"P Renjith","year":"2017","unstructured":"Renjith, P., Sadagopan, N.: Hamiltonicity in split graphs - a dichotomy. In: Gaur, D., Narayanaswamy, N.S. (eds.) CALDAM 2017. LNCS, vol. 10156, pp. 320\u2013331. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53007-9_28"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Renjith, P., Sadagopan, N.: Hamiltonian path in split graphs-a dichotomy. arXiv preprint arXiv:1711.09262 (2017)","DOI":"10.1007\/978-3-319-53007-9_28"},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1016\/j.akcej.2020.01.005","volume":"17","author":"C Padamutham","year":"2020","unstructured":"Padamutham, C., Palagiri, V.S.R.: Complexity of Roman 2-domination and the double Roman domination in graphs. AKCE Int. J. Graphs Comb. 17(3), 1081\u20131086 (2020)","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"4 &5","key":"17_CR9","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.3934\/dcdss.2019081","volume":"12","author":"L Guo","year":"2019","unstructured":"Guo, L., Lin, B.L.S.: Vulnerability of super connected split graphs and bisplit graphs. Discret. Contin. Dynam. Syst.-S 12(4 &5), 1179 (2019)","journal-title":"Discret. Contin. Dynam. Syst.-S"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Rosenfeld, M., Kahn, G., Beaudou, L.: Bisplit graphs satisfy the Chen-Chv\u00e1tal conjecture. Discret. Math. Theor. Comput. Sci. 21 (2019)","DOI":"10.23638\/DMTCS-21-1-5"},{"issue":"1","key":"17_CR11","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)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"17_CR12","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1137\/0217032","volume":"17","author":"A D\u2019Atri","year":"1988","unstructured":"D\u2019Atri, A., Moscarini, M.: Distance-hereditary graphs, steiner trees, and connected domination. SIAM J. Comput. 17(3), 521\u2013538 (1988)","journal-title":"SIAM J. Comput."},{"key":"17_CR13","unstructured":"Aadhavan, S., Mahendra Kumar, R., Renjith, P., Sadagopan, N.: Hamiltonicity: Variants and Generalization in $$P_5 $$-free Chordal Bipartite graphs. arXiv preprint arXiv:2107.04798 (2021)"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10878-015-9917-3","volume":"32","author":"H Chen","year":"2016","unstructured":"Chen, H., Lei, Z., Liu, T., Tang, Z., Wang, C., Ke, X.: Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. J. Comb. Optim. 32(1), 95\u2013110 (2016)","journal-title":"J. Comb. Optim."},{"issue":"24","key":"17_CR15","doi-asserted-by":"publisher","first-page":"2865","DOI":"10.1016\/j.disc.2013.08.032","volume":"313","author":"R Krithika","year":"2013","unstructured":"Krithika, R., Mathew, R., Narayanaswamy, N.S., Sadagopan, N.: A Dirac-type characterization of k-chordal graphs. Discre. Math. 313(24), 2865\u20132867 (2013)","journal-title":"Discre. Math."},{"key":"17_CR16","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)","journal-title":"Discret. Appl. Math."},{"issue":"2\u20133","key":"17_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(87)90067-3","volume":"53","author":"H M\u00fcller","year":"1987","unstructured":"M\u00fcller, H., Brandst\u00e4dt, A.: The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs. Theoret. Comput. Sci. 53(2\u20133), 257\u2013265 (1987)","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.dam.2018.06.028","volume":"280","author":"S Dhanalakshmi","year":"2020","unstructured":"Dhanalakshmi, S., Sadagopan, N.: On strictly chordality-k graphs. Discret. Appl. Math. 280, 93\u2013112 (2020)","journal-title":"Discret. Appl. Math."}],"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-25211-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T22:44:09Z","timestamp":1767134649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25211-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031252105","9783031252112"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25211-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","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":"Gandhinagar","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 February 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2023.daiict.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}