{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:03:53Z","timestamp":1770966233680,"version":"3.50.1"},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T00:00:00Z","timestamp":1765929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T00:00:00Z","timestamp":1765929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004543","name":"China Scholarship Council Program","doi-asserted-by":"crossref","award":["No. 20230812009"],"award-info":[{"award-number":["No. 20230812009"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010446","name":"Institute of Basic Science","doi-asserted-by":"crossref","award":["IBS-R029-C4"],"award-info":[{"award-number":["IBS-R029-C4"]}],"id":[{"id":"10.13039\/501100010446","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1007\/s00373-025-03004-6","type":"journal-article","created":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T17:56:49Z","timestamp":1765994209000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A note on a new result related to Chartrand, Kaugars and Lick\u2019s theorem"],"prefix":"10.1007","volume":"42","author":[{"given":"Zhong","family":"Huang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1618-572X","authenticated-orcid":false,"given":"Meng","family":"Ji","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,17]]},"reference":[{"key":"3004_CR1","volume-title":"Graph Theory, Graduate Texts in Mathematics 244","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, Graduate Texts in Mathematics 244. Springer, Berlin (2008)"},{"key":"3004_CR2","first-page":"63","volume":"32","author":"G Chartrand","year":"1972","unstructured":"Chartrand, G., Kaugars, A., Lick, D.R.: Critically $$n$$-connected graphs. Proc. Amer. Math. Soc. 32, 63\u201368 (1972)","journal-title":"Proc. Amer. Math. Soc."},{"key":"3004_CR3","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.jctb.2007.11.001","volume":"98","author":"S Fujita","year":"2008","unstructured":"Fujita, S., Kawarabayashi, K.: Connectivity keeping edges in graphs with large minimum degree. J. Combin. Theory Ser. B 98, 805\u2013811 (2008)","journal-title":"J. Combin. Theory Ser. B"},{"key":"3004_CR4","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"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03004-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-03004-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-03004-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:04:51Z","timestamp":1770962691000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-03004-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,17]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,2]]}},"alternative-id":["3004"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-03004-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,17]]},"assertion":[{"value":"12 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"8"}}