{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:18:21Z","timestamp":1761808701662,"version":"3.41.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T00:00:00Z","timestamp":1737158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T00:00:00Z","timestamp":1737158400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Natural Science Foundation of China","doi-asserted-by":"crossref","award":["11961051"],"award-info":[{"award-number":["11961051"]}],"id":[{"id":"10.13039\/501100001809","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":[[2025,2]]},"DOI":"10.1007\/s00373-025-02890-0","type":"journal-article","created":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T10:52:10Z","timestamp":1737197530000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Contractible Edges in Spanning Trees of 3-Connected Graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0512-0397","authenticated-orcid":false,"given":"Chengfu","family":"Qin","sequence":"first","affiliation":[]},{"given":"Jin","family":"Geng","sequence":"additional","affiliation":[]},{"given":"Hailing","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Xiaoqing","family":"Xie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,18]]},"reference":[{"issue":"1","key":"2890_CR1","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1002\/jgt.21635","volume":"72","author":"A Elmasry","year":"2013","unstructured":"Elmasry, A., Mehlhorn, K., Schmidt, J.M.: Every DFS tree of a 3-connected graph contains a contractible edge. J. Graph Theory 72(1), 112\u2013121 (2013)","journal-title":"J. Graph Theory"},{"key":"2890_CR2","doi-asserted-by":"publisher","first-page":"83","DOI":"10.7151\/dmgt.2172","volume":"41","author":"DV Karpov","year":"2021","unstructured":"Karpov, D.V.: Large contractible subgraphs of a 3-connected graph. Discussiones mathematicae graph theory 41, 83\u2013101 (2021)","journal-title":"Discussiones mathematicae graph theory"},{"key":"2890_CR3","first-page":"141","volume":"30","author":"F Tan","year":"2004","unstructured":"Tan, F., Wu, H.: On contractible edges in 3-connected graphs. Australas. J. Combin. 30, 141\u2013146 (2004)","journal-title":"Australas. J. Combin."},{"key":"2890_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s00373-006-0661-4","volume":"22","author":"J Anderson","year":"2006","unstructured":"Anderson, J., Wu, H.: An extremal problem on contractible edges in 3-connected graphs. Graphs Combin. 22, 145\u2013152 (2006)","journal-title":"Graphs Combin."},{"key":"2890_CR5","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0095-8956(87)90065-7","volume":"42","author":"K Ando","year":"1987","unstructured":"Ando, K., Enomoto, H., Saito, A.: Contractible edges in 3-connected graphs. J. Combin. Theory Ser. B 42, 87\u201393 (1987)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2890_CR6","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF01864172","volume":"4","author":"K Ota","year":"1988","unstructured":"Ota, K.: The number of contractible edges in 3-connected graphs. Graphs Combin. 4, 333\u2013354 (1988)","journal-title":"Graphs Combin."},{"key":"2890_CR7","first-page":"101","volume":"2","author":"K Ota","year":"1988","unstructured":"Ota, K., Saito, A.: Non-separating induced cycles in 3-connected graphs. Scientia Ser. A 2, 101\u2013105 (1988)","journal-title":"Scientia Ser. A"},{"issue":"5","key":"2890_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2023.113321","volume":"346","author":"K Ando","year":"2023","unstructured":"Ando, K., Egawa, Y.: Properly 3-contractible edges in a minimally 3-connected graph. Discrete Math. 346(5), 113321 (2023)","journal-title":"Discrete Math."},{"key":"2890_CR9","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.1007\/s00373-021-02354-1","volume":"37","author":"K Ando","year":"2021","unstructured":"Ando, K., Egawa, Y.: Contractible edges and contractible triangles in a 3-connected graph. Graphs Combin. 37, 1807\u20131821 (2021)","journal-title":"Graphs Combin."},{"key":"2890_CR10","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1006\/jctb.2000.1960","volume":"80","author":"M Kriesell","year":"2000","unstructured":"Kriesell, M.: Contractible subgraphs in 3-connected graphs. J. Combin. Theory Ser. B 80, 32\u201348 (2000)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2","key":"2890_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1002\/jgt.22243","volume":"89","author":"M Kriesell","year":"2018","unstructured":"Kriesell, M., Schmidt, J.M.: More on foxes. J. Graph Theory 89(2), 101\u2013114 (2018)","journal-title":"J. Graph Theory"},{"key":"2890_CR12","doi-asserted-by":"crossref","unstructured":"Tutte, W.T.: A theory of $$3$$-connected graphs. Indagationes mathematicae (Proceedings) 64 (1961)","DOI":"10.1016\/S1385-7258(61)50045-5"},{"key":"2890_CR13","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0012-365X(88)90216-6","volume":"72","author":"W Mader","year":"1988","unstructured":"Mader, W.: Generalizations of critical connectivity of graphs. Discrete Math. 72, 267\u2013283 (1988)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02890-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02890-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02890-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:41Z","timestamp":1748319761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02890-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,18]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2890"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02890-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,1,18]]},"assertion":[{"value":"14 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 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 author has not disclosed any conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"22"}}