{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T12:18:30Z","timestamp":1768306710961,"version":"3.49.0"},"publisher-location":"Cham","reference-count":14,"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_14","type":"book-chapter","created":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:02:29Z","timestamp":1705140149000},"page":"194-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Impact of\u00a0Diameter and\u00a0Convex Ordering for\u00a0Hamiltonicity and\u00a0Domination"],"prefix":"10.1007","author":[{"given":"R.","family":"Mahendra Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Sadagopan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,1,14]]},"reference":[{"issue":"1","key":"14_CR1","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., Xu, K.: 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":"1\u20133","key":"14_CR2","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\u20133), 291\u2013298 (1996)","journal-title":"Discret. Math."},{"issue":"3","key":"14_CR3","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."},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.tcs.2012.12.021","volume":"507","author":"W Jiang","year":"2013","unstructured":"Jiang, W., Liu, T., Wang, C., Xu, K.: Feedback vertex sets on restricted bipartite graphs. Theor. Comput. Sci. 507, 41\u201351 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR5","first-page":"35","volume":"38","author":"J Cyman","year":"2007","unstructured":"Cyman, J.: The outer-connected domination number of a graph. Australas. J. Comb. 38, 35\u201346 (2007)","journal-title":"Australas. J. Comb."},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-04657-0_16","volume-title":"Algorithms and Computation","author":"BS Panda","year":"2014","unstructured":"Panda, B.S., Pandey, A.: Algorithm and hardness results for outer-connected dominating set in graphs. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 151\u2013162. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-04657-0_16"},{"issue":"1","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10878-013-9703-z","volume":"31","author":"D Pradhan","year":"2016","unstructured":"Pradhan, D.: On the complexity of the minimum outer-connected dominating set problem in graphs. J. Comb. Optim. 31(1), 1\u201312 (2016)","journal-title":"J. Comb. Optim."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.dam.2018.03.029","volume":"252","author":"A Pandey","year":"2019","unstructured":"Pandey, A., Panda, B.S.: Domination in some subclasses of bipartite graphs. Discrete Appl. Math. 252, 51\u201366 (2019)","journal-title":"Discrete Appl. Math."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1007\/978-3-642-33090-2_69","volume-title":"Algorithms \u2013 ESA 2012","author":"JA Telle","year":"2012","unstructured":"Telle, J.A., Villanger, Y.: FPT algorithms for domination in biclique-free graphs. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 802\u2013812. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_69"},{"issue":"01","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0129054121500337","volume":"33","author":"P Renjith","year":"2022","unstructured":"Renjith, P., Sadagopan, N.: Hamiltonian cycle in $$K_{1, r}$$-free split graphs-a dichotomy. Int. J. Found. Comput. Sci. 33(01), 1\u201332 (2022)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-74180-2_3","volume-title":"Algorithms and Discrete Applied Mathematics","author":"P Renjith","year":"2018","unstructured":"Renjith, P., Sadagopan, N.: Hamiltonian path in $$K_{1,t}$$-free split graphs- a dichotomy. In: Panda, B.S., Goswami, P.P. (eds.) CALDAM 2018. LNCS, vol. 10743, pp. 30\u201344. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-74180-2_3"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-95018-7_10","volume-title":"Algorithms and Discrete Applied Mathematics","author":"A Mohanapriya","year":"2022","unstructured":"Mohanapriya, A., Renjith, P., Sadagopan, N.: P versus NPC: minimum Steiner trees in convex split graphs. In: Balachandran, N., Inkulu, R. (eds.) CALDAM 2022. LNCS, vol. 13179, pp. 115\u2013126. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-95018-7_10"},{"key":"14_CR13","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)"},{"key":"14_CR14","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2003","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice hall, Upper Saddle River (2003)","edition":"2"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T05:22:29Z","timestamp":1768281749000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52213-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031522123","9783031522130"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52213-0_14","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"}}]}}