{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T15:28:12Z","timestamp":1768318092525,"version":"3.49.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319741796","type":"print"},{"value":"9783319741802","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-74180-2_3","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"30-44","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hamiltonian Path in $$K_{1,t}$$-free Split Graphs- A Dichotomy"],"prefix":"10.1007","author":[{"given":"Pazhaniappan","family":"Renjith","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Narasimhan","family":"Sadagopan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"issue":"1","key":"3_CR1","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. Discrete Math. 251(1), 47\u201369 (2002)","journal-title":"Discrete Math."},{"issue":"1","key":"3_CR2","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(1), 7\u201352 (2003)","journal-title":"Graphs Comb."},{"issue":"4","key":"3_CR3","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(4), 195\u2013200 (1986)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3_CR4","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. Discrete Math. 156(1), 291\u2013298 (1996)","journal-title":"Discrete Math."},{"issue":"4","key":"3_CR5","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(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"issue":"24","key":"3_CR6","doi-asserted-by":"publisher","first-page":"6166","DOI":"10.1016\/j.disc.2007.11.040","volume":"308","author":"VS Gordon","year":"2008","unstructured":"Gordon, V.S., Orlovich, Y.L., Werner, F.: Hamiltonian properties of triangular grid graphs. Discrete Math. 308(24), 6166\u20136188 (2008)","journal-title":"Discrete Math."},{"issue":"4","key":"3_CR7","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(4), 201\u2013206 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"3_CR8","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^{2}$$log n) algorithm for the Hamiltonian cycle problem on circular-arc graphs. SIAM J. Comput. 21(6), 1026\u20131046 (1992)","journal-title":"SIAM J. Comput."},{"key":"3_CR9","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":"3_CR10","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2003","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall of India, New Delhi (2003)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Renjith, P., Sadagopan, N.: Hamiltonian path in split graphs - a dichotomy. In: arXiv (2017)","DOI":"10.1007\/978-3-319-53007-9_28"},{"issue":"2","key":"3_CR12","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."}],"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-319-74180-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:50:34Z","timestamp":1709826634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 January 2018","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":"Guwahati","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}