{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:20:42Z","timestamp":1743117642547,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_28","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"320-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Hamiltonicity in Split Graphs - A Dichotomy"],"prefix":"10.1007","author":[{"given":"P.","family":"Renjith","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":[[2017,1,26]]},"reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(86)90135-3","volume":"23","author":"AA Bertossi","year":"1986","unstructured":"Bertossi, A.A., Bonuccelli, M.A.: Hamiltonian circuits in interval graph generalizations. Inf. Process. Lett. 23, 195\u2013200 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"14","key":"28_CR2","doi-asserted-by":"publisher","first-page":"2140","DOI":"10.1016\/j.disc.2011.07.013","volume":"312","author":"A Kemnitz","year":"2012","unstructured":"Kemnitz, A., Schiermeyer, I.: Improved degree conditions for Hamiltonian properties. Discret. Math. 312(14), 2140\u20132145 (2012)","journal-title":"Discret. Math."},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0378-4371(76)90002-9","volume":"84","author":"A Malakis","year":"1976","unstructured":"Malakis, A.: Hamiltonian walks and polymer configurations. Stat. Mech. Appl. Phys. (A) 84, 256\u2013284 (1976)","journal-title":"Stat. Mech. Appl. Phys. (A)"},{"issue":"18","key":"28_CR4","doi-asserted-by":"publisher","first-page":"2681","DOI":"10.1016\/j.dam.2010.12.014","volume":"160","author":"CMH Figueiredo de","year":"2012","unstructured":"de Figueiredo, C.M.H.: The P versus NP-complete dichotomy of some challenging problems in graph theory. Discret. Appl. Math. 160(18), 2681\u20132693 (2012)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(93)E0204-H","volume":"141","author":"D Bauer","year":"1995","unstructured":"Bauer, D., Broersma, H.J., Heuvel, J., Veldman, H.J.: Long cycles in graphs with prescribed toughness and minimum degree. Discret. Math. 141(1), 1\u201310 (1995)","journal-title":"Discret. Math."},{"key":"28_CR6","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. (2003)"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0166-218X(92)00171-H","volume":"50","author":"D Dorninger","year":"1994","unstructured":"Dorninger, D.: Hamiltonian circuits determining the order of chromosomes. Discret. Appl. Math. 50, 159\u2013168 (1994)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0012-365X(95)00190-8","volume":"150","author":"D Kratsch","year":"1996","unstructured":"Kratsch, D., Lehel, J., Muller, H.: Toughness, Hamiltonicity and split graphs. Discret. Math. 150(1), 231\u2013245 (1996)","journal-title":"Discret. Math."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1016\/j.ejor.2006.05.009","volume":"180","author":"G Irina","year":"2007","unstructured":"Irina, G., Halskau, O., Laporte, G., Vlcek, M.: General solutions to the single vehicle routing problem with pickups and deliveries. Euro. J. Oper. Res. 180, 568\u2013584 (2007)","journal-title":"Euro. J. Oper. Res."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0012-365X(01)00325-9","volume":"251","author":"HJ Broersma","year":"2002","unstructured":"Broersma, H.J.: On some intriguing problems in Hamiltonian graph theory - a survey. Discret. Math. 251, 47\u201369 (2002)","journal-title":"Discret. Math."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(95)00057-4","volume":"156","author":"H Muller","year":"1996","unstructured":"Muller, H.: Hamiltonian circuits in chordal bipartite graphs. Discret. Math. 156, 291\u2013298 (1996)","journal-title":"Discret. Math."},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0020-0190(85)90050-X","volume":"20","author":"JM Keil","year":"1985","unstructured":"Keil, J.M.: Finding Hamiltonian circuits in interval graphs. Inf. Process. Lett. 20, 201\u2013206 (1985)","journal-title":"Inf. Process. Lett."},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-29221-2_27","volume-title":"Algorithms and Discrete Applied Mathematics","author":"M Illuri","year":"2016","unstructured":"Illuri, M., Renjith, P., Sadagopan, N.: Complexity of steiner tree in split graphs - dichotomy results. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 308\u2013325. Springer, Heidelberg (2016). doi:\n                    10.1007\/978-3-319-29221-2_27"},{"key":"28_CR14","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1137\/0205049","volume":"5","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Tarjan, R.E.: Planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5, 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"28_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.disc.2005.03.008","volume":"296","author":"ND Tan","year":"2005","unstructured":"Tan, N.D., Hung, L.X.: On the Burkard-Hammer condition for Hamiltonian split graphs. Discret. Math. 296(1), 59\u201372 (2005)","journal-title":"Discret. Math."},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"549","DOI":"10.7155\/jgaa.00377","volume":"19","author":"NS Narayanaswamy","year":"2015","unstructured":"Narayanaswamy, N.S., Sadagopan, N.: Connected (s, t)-vertex separator parameterized by chordality. J. Graph Algorithms Appl. 19(1), 549\u2013565 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"28_CR17","unstructured":"Renjith, P., Sadagopan, N.: Hamiltonicity in split graphs - a dichotomy. \n                    https:\/\/arxiv.org\/abs\/1610.00855"},{"issue":"2","key":"28_CR18","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0095-8956(80)90069-6","volume":"28","author":"RE Burkard","year":"1980","unstructured":"Burkard, R.E., Hammer, P.L.: A note on Hamiltonian split graphs. J. Comb. Theory Ser. B 28(2), 245\u2013248 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/jgt.3190150204","volume":"15","author":"RJ Gould","year":"1991","unstructured":"Gould, R.J.: Updating the Hamiltonian problem - a survey. J. Graph Theory 15, 121\u2013157 (1991)","journal-title":"J. Graph Theory"},{"key":"28_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s00373-002-0492-x","volume":"19","author":"RJ Gould","year":"2003","unstructured":"Gould, R.J.: Advances on the Hamiltonian problem - a survey. Graphs Comb. 19, 7\u201352 (2003)","journal-title":"Graphs Comb."},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/j.tcs.2005.04.009","volume":"341","author":"RW Hung","year":"2005","unstructured":"Hung, R.W., Chang, M.S.: Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs. Theoret. Comput. Sci. 341, 411\u2013440 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"28_CR22","unstructured":"Hung, R.W., Chang, M.S., Laio, C.H.: The Hamiltonian cycle problem on circular-arc graphs. In: Proceedings of the International Conference of Engineers and Computer Scientists (IMECS, Hong Kong), pp. 18\u201320 (2009)"},{"issue":"2","key":"28_CR23","first-page":"73","volume":"3","author":"T Akiyama","year":"1980","unstructured":"Akiyama, T., Nishizeki, T., Saito, N.: NP-completeness of the Hamiltonian cycle problem for bipartite graphs. J. Inf. Process. 3(2), 73\u201376 (1980)","journal-title":"J. Inf. Process."},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","volume":"5","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Tough graphs and Hamiltonian circuits. Discret. Math. 5, 215\u2013228 (1973)","journal-title":"Discret. Math."},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1137\/0221061","volume":"21","author":"WK Shih","year":"1992","unstructured":"Shih, W.K., Chern, T.C., Hsu, W.L.: An O(\n                    \n                      \n                    \n                    $$n^{2}$$\n                    \n                      \n                        \n                          n\n                          2\n                        \n                      \n                    \n                  log n) algorithm for the Hamiltonian cycle problem on circular-arc graphs. SIAM J. Comput. 21, 1026\u20131046 (1992)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:42:14Z","timestamp":1558316534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"26 January 2017","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":"Sancoale","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":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 February 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 February 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}