{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:40:04Z","timestamp":1748320804483,"version":"3.41.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T00:00:00Z","timestamp":1735171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T00:00:00Z","timestamp":1735171200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"JSPS KAKENHI","award":["JP19K11829"],"award-info":[{"award-number":["JP19K11829"]}]}],"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-02874-6","type":"journal-article","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T06:41:06Z","timestamp":1735195266000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Connectivity Preserving Hamiltonian Cycles in k-Connected Dirac Graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4887-9179","authenticated-orcid":false,"given":"Toru","family":"Hasunuma","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,26]]},"reference":[{"key":"2874_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":"2874_CR2","first-page":"61","volume-title":"Theory of Graphs","author":"G Chartrand","year":"1968","unstructured":"Chartrand, G., Harary, F.: Graphs with prescribed connectivities. In: Erd\u0151s, P., Katona, G. (eds.) Theory of Graphs, pp. 61\u201363. Academic Press, New York (1968)"},{"key":"2874_CR3","first-page":"109","volume":"48","author":"G Chartrand","year":"1969","unstructured":"Chartrand, G., Kapoor, S.F., Kronk, H.V.: A generalization of hamiltonian-connected graphs. J. Math. Pures Appl. 48, 109\u2013116 (1969)","journal-title":"J. Math. Pures Appl."},{"key":"2874_CR4","volume-title":"Graphs & Digraphs","author":"G Chartrand","year":"1996","unstructured":"Chartrand, G., Lesniak, L.: Graphs & Digraphs, 3rd edn. Chapman & Hall, London (1996)","edition":"3"},{"key":"2874_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00493-009-2360-2","volume":"29","author":"B Cuckler","year":"2009","unstructured":"Cuckler, B., Kahn, J.: Hamiltonian cycles in Dirac graphs. Combinatorica 29, 299\u2013326 (2009)","journal-title":"Combinatorica"},{"key":"2874_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69\u201381 (1952)","journal-title":"Proc. Lond. Math. Soc."},{"key":"2874_CR7","doi-asserted-by":"publisher","first-page":"5235","DOI":"10.1016\/j.disc.2009.03.037","volume":"309","author":"AA Diwan","year":"2009","unstructured":"Diwan, A.A., Tholiya, N.P.: Non-separating trees in connected graphs. Discrete Math. 309, 5235\u20135237 (2009)","journal-title":"Discrete Math."},{"key":"2874_CR8","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":"2874_CR9","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1002\/jgt.22878","volume":"102","author":"T Hasunuma","year":"2023","unstructured":"Hasunuma, T.: Connectivity preserving trees in $$k$$-connected or $$k$$-edge-connected graphs. J. Graph Theory 102, 423\u2013435 (2023)","journal-title":"J. Graph Theory"},{"key":"2874_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/jgt.22831","volume":"101","author":"Y Hong","year":"2022","unstructured":"Hong, Y., Liu, Q.: Mader\u2019s conjecture for graphs with small connectivity. J. Graph Theory 101, 379\u2013388 (2022)","journal-title":"J. Graph Theory"},{"key":"2874_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1112\/jlms\/s2-21.3.385","volume":"21","author":"B Jackson","year":"1980","unstructured":"Jackson, B.: Removal cycles in 2-connected graphs with minimum degree at least four. J. Lond. Math. Soc. 21, 385\u2013392 (1980)","journal-title":"J. Lond. Math. Soc."},{"key":"2874_CR12","doi-asserted-by":"publisher","first-page":"3095","DOI":"10.1090\/S0002-9947-2014-05963-1","volume":"366","author":"M Krivelevich","year":"2014","unstructured":"Krivelevich, M., Lee, C., Sudakov, B.: Robust Hamiltonicity of Dirac graphs. Trans. Am. Math. Soc. 366, 3095\u20133130 (2014)","journal-title":"Trans. Am. Math. Soc."},{"key":"2874_CR13","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/s00493-016-3328-7","volume":"37","author":"M Krivelevich","year":"2017","unstructured":"Krivelevich, M., Lee, C., Sudakov, B.: Compatible Hamilton cycles in Dirac graphs. Combinatorica 37, 697\u2013732 (2017)","journal-title":"Combinatorica"},{"key":"2874_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113679","volume":"346","author":"H Liu","year":"2023","unstructured":"Liu, H., Liu, Q., Hong, Y.: Connectivity keeping trees in 3-connected or 3-edge-connected graphs. Discrete Math. 346, 113679 (2023)","journal-title":"Discrete Math."},{"key":"2874_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF02993546","volume":"42","author":"W Mader","year":"1974","unstructured":"Mader, W.: Kreuzungsfreie $$a$$, $$b$$-Wege in endlichen Graphen. Abhandlungen Math. Sem. Univ. Hamburg 42, 187\u2013204 (1974)","journal-title":"Abhandlungen Math. Sem. Univ. Hamburg"},{"key":"2874_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/jgt.20465","volume":"65","author":"W Mader","year":"2010","unstructured":"Mader, W.: Connectivity keeping paths in $$k$$-connected graphs. J. Graph Theory 65, 61\u201369 (2010)","journal-title":"J. Graph Theory"},{"key":"2874_CR17","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1002\/jgt.20585","volume":"69","author":"W Mader","year":"2012","unstructured":"Mader, W.: Connectivity keeping trees in $$k$$-connected graphs. J. Graph Theory 69, 324\u2013329 (2012)","journal-title":"J. Graph Theory"},{"key":"2874_CR18","first-page":"157","volume-title":"Studies in Pure Mathematics","author":"CSJA Nash-Williams","year":"1971","unstructured":"Nash-Williams, C.S.J.A.: Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency. In: Mirsky, L. (ed.) Studies in Pure Mathematics, pp. 157\u2013183. Academic Press, New York (1971)"},{"key":"2874_CR19","first-page":"225","volume":"7","author":"L P\u00f3sa","year":"1962","unstructured":"P\u00f3sa, L.: A theorem concerning Hamilton lines. Magyar. Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl. 7, 225\u2013226 (1962)","journal-title":"Magyar. Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"2874_CR20","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0012-365X(85)90161-X","volume":"57","author":"S Ruiz","year":"1985","unstructured":"Ruiz, S.: Randomly decomposable graphs. Discrete Math. 57, 123\u2013128 (1985)","journal-title":"Discrete Math."},{"key":"2874_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.113913","volume":"347","author":"Q Yang","year":"2024","unstructured":"Yang, Q., Tian, Y.: Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs. Discrete Math. 347, 113913 (2024)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02874-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02874-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-02874-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:37Z","timestamp":1748319757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02874-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,26]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2874"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02874-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,26]]},"assertion":[{"value":"9 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 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 author declares that he has no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"10"}}