{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T17:29:39Z","timestamp":1761845379712,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T00:00:00Z","timestamp":1621900800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JP19K11829"],"award-info":[{"award-number":["JP19K11829"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s00453-021-00833-8","type":"journal-article","created":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T07:02:21Z","timestamp":1621926141000},"page":"2697-2718","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Connectivity Keeping Trees in 2-Connected Graphs with Girth Conditions"],"prefix":"10.1007","volume":"83","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":[[2021,5,25]]},"reference":[{"key":"833_CR1","first-page":"63","volume":"32","author":"G Chartrand","year":"1972","unstructured":"Chartrand, G., Kaugars, A., Lick, D.R.: Critically $$n$$-connected graphs. Proc. Am. Math. Soc. 32, 63\u201368 (1972)","journal-title":"Proc. Am. Math. Soc."},{"key":"833_CR2","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":"833_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":"833_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1002\/jgt.22504","volume":"94","author":"T Hasunuma","year":"2020","unstructured":"Hasunuma, T., Ono, K.: Connectivity keeping trees in 2-connected graphs. J. Graph Theory 94, 20\u201329 (2020)","journal-title":"J. Graph Theory"},{"key":"833_CR5","doi-asserted-by":"publisher","first-page":"112236","DOI":"10.1016\/j.disc.2020.112236","volume":"344","author":"Y Hong","year":"2021","unstructured":"Hong, Y., Liu, Q., Lu, C., Ye, Q.: Connectivity keeping caterpillars and spiders in 2-connected graphs. Discrete Math. 344, 112236 (2021)","journal-title":"Discrete Math."},{"key":"833_CR6","first-page":"176","volume":"105","author":"SC Locke","year":"1998","unstructured":"Locke, S.C.: Problem 10647. MAA Mon. 105, 176 (1998)","journal-title":"MAA Mon."},{"key":"833_CR7","doi-asserted-by":"publisher","first-page":"111677","DOI":"10.1016\/j.disc.2019.111677","volume":"343","author":"C Lu","year":"2020","unstructured":"Lu, C., Zhang, P.: Connectivity keeping trees in 2-connected graphs. Discrete Math. 343, 111677 (2020)","journal-title":"Discrete Math."},{"key":"833_CR8","doi-asserted-by":"crossref","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":"833_CR9","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1016\/j.disc.2017.10.017","volume":"341","author":"Y Tian","year":"2018","unstructured":"Tian, Y., Meng, J., Lai, H.-J., Xu, L.: Connectivity keeping stars or double stars in 2-connected graphs. Discrete Math. 341, 1120\u20131124 (2018)","journal-title":"Discrete Math."},{"key":"833_CR10","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.disc.2018.10.001","volume":"342","author":"Y Tian","year":"2019","unstructured":"Tian, Y., Xu, L., Meng, J., Lai, H.-J.: Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. Discrete Math. 342, 344\u2013351 (2019)","journal-title":"Discrete Math."},{"key":"833_CR11","doi-asserted-by":"publisher","DOI":"10.3138\/9781487584863","volume-title":"Connectivity in Graphs","author":"WT Tutte","year":"1966","unstructured":"Tutte, W.T.: Connectivity in Graphs. University of Toronto Press, Toronto (1966)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00833-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00833-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00833-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T03:49:57Z","timestamp":1699069797000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00833-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,25]]},"references-count":11,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["833"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00833-8","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2021,5,25]]},"assertion":[{"value":"29 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}