{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:48:18Z","timestamp":1781077698444,"version":"3.54.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031630200","type":"print"},{"value":"9783031630217","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-63021-7_14","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"180-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Structure of\u00a0Hamiltonian Graphs with\u00a0Small Independence Number"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9518-6386","authenticated-orcid":false,"given":"Nikola","family":"Jedli\u010dkov\u00e1","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2620-6133","authenticated-orcid":false,"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"14_CR1","unstructured":"Barnette, D.: Conjecture 5. Recent progress in combinatorics. In: Proceedings of the Third Waterloo Conference on Combinatorics. Academic Press, New York (1969)"},{"issue":"4","key":"14_CR2","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":"2","key":"14_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","volume":"2","author":"V Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V., Erd\u00f6s, P.: A note on Hamiltonian circuits. Discrete Math. 2(2), 111\u2013113 (1972)","journal-title":"Discrete Math."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(89)90059-8","volume":"32","author":"P Damaschke","year":"1989","unstructured":"Damaschke, P.: The Hamiltonian circuit problem for circle graphs is NP-complete. Inf. Process. Lett. 32(1), 1\u20132 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"14_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0012-365X(93)90223-G","volume":"112","author":"P Damaschke","year":"1993","unstructured":"Damaschke, P.: Paths in interval graphs and circular-arc graphs. Discrete Math. 112(1\u20133), 49\u201364 (1993)","journal-title":"Discrete Math."},{"issue":"4","key":"14_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF00571188","volume":"8","author":"P Damaschke","year":"1991","unstructured":"Damaschke, P., Deogun, J.S., Kratsch, D., Steiner, G.: Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm. Order 8(4), 383\u2013391 (1991)","journal-title":"Order"},{"key":"14_CR7","unstructured":"Duffus, D., Gould, R., Jacobson, M.: Forbidden subgraphs and the Hamiltonian theme. In: I4th International Conference on the Theory and Applications of Graphs, Kalamazoo, pp. 297\u2013316. Wiley (1981)"},{"issue":"4","key":"14_CR8","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.: The planar Hamiltonian circuit problem is NP-complete. SIAM J. Comput. 5(4), 704\u2013714 (1976)","journal-title":"SIAM J. Comput."},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"issue":"1","key":"14_CR10","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":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-013-1377-x","volume":"30","author":"RJ Gould","year":"2014","unstructured":"Gould, R.J.: Recent advances on the Hamiltonian problem: survey III. Graphs Comb. 30(1), 1\u201346 (2014)","journal-title":"Graphs Comb."},{"key":"14_CR12","unstructured":"Jedli\u010dkov\u00e1, N., Kratochv\u00edl, J.: Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number. arXiv preprint arXiv:2309.09228 (2023)"},{"key":"14_CR13","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. IRSS, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"14_CR14","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":"1\u20133","key":"14_CR15","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. Discrete Math. 156(1\u20133), 291\u2013298 (1996)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:11:58Z","timestamp":1718975518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_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":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}