{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:53Z","timestamp":1748404913041,"version":"3.41.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T00:00:00Z","timestamp":1734048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871439","11971439","U20A2068"],"award-info":[{"award-number":["11871439","11971439","U20A2068"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00373-024-02858-6","type":"journal-article","created":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T14:27:34Z","timestamp":1734100054000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hamiltonian Cycles and Tight Cutsets"],"prefix":"10.1007","volume":"41","author":[{"given":"Viswanathan B.","family":"N","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8818-1667","authenticated-orcid":false,"given":"Douglas B.","family":"West","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"2858_CR1","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Chv\u00e1tal, V.: A method in graph theory. Discrete Math. 15, 111\u2013135 (1976)","journal-title":"Discrete Math."},{"key":"2858_CR2","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. Discrete Math. 5, 215\u2013228 (1973)","journal-title":"Discrete Math."},{"key":"2858_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\u0151s, P.: A note on Hamiltonian circuits. Discrete Math. 2, 111\u2013113 (1972)","journal-title":"Discrete Math."},{"key":"2858_CR4","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\u2014a survey. J. Graph Theory 15, 121\u2013157 (1991)","journal-title":"J. Graph Theory"},{"key":"2858_CR5","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\u2014a survey. Graphs Comb. 19, 7\u201352 (2003)","journal-title":"Graphs Comb."},{"key":"2858_CR6","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\u201346 (2014)","journal-title":"Graphs Comb."},{"key":"2858_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0095-8956(80)90042-8","volume":"29","author":"B Jackson","year":"1980","unstructured":"Jackson, B.: Hamilton cycles in regular 2-connected graphs. J. Comb. Theory Ser. B 29, 27\u201346 (1980)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2858_CR8","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N.Y., 1972), The IBM Research Symposia Series Plenum, New York-London, pp. 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"2858_CR9","first-page":"25","volume":"7","author":"K Kawarabayashi","year":"2001","unstructured":"Kawarabayashi, K.: A survey on Hamiltonian cycles. Interdiscip. Inf. Sci. 7, 25\u201339 (2001)","journal-title":"Interdiscip. Inf. Sci."},{"key":"2858_CR10","doi-asserted-by":"publisher","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K Kuratowski","year":"1930","unstructured":"Kuratowski, K.: Sur le probl\u00e8me des courbes gauches en topologie. Fund. Math. 15, 271\u2013283 (1930)","journal-title":"Fund. Math."},{"key":"2858_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1960","unstructured":"Ore, O.: Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)","journal-title":"Am. Math. Mon."},{"key":"2858_CR12","doi-asserted-by":"crossref","unstructured":"Zhu, Y.J., Liu, Z.H., Yu, Z.G.: An improvement of Jackson\u2019s result on Hamilton cycles in 2-connected regular graphs. In: Cycles in graphs (Burnaby, B.C., 1982), North-Holland Math. Stud. Vol. 115, Ann. Discrete Math., vol 27, pp. 237\u2013247. North-Holland, Amsterdam (1985)","DOI":"10.1016\/S0304-0208(08)73018-4"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02858-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02858-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02858-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:36Z","timestamp":1748319756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02858-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,13]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2858"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02858-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,12,13]]},"assertion":[{"value":"12 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 April 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"5"}}