{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:21:34Z","timestamp":1765164094093,"version":"3.46.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T00:00:00Z","timestamp":1764288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T00:00:00Z","timestamp":1764288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NNSFC","doi-asserted-by":"crossref","award":["11371133"],"award-info":[{"award-number":["11371133"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100007957","name":"Chongqing Municipal Education Commission","doi-asserted-by":"publisher","award":["KJZD-K202401307"],"award-info":[{"award-number":["KJZD-K202401307"]}],"id":[{"id":"10.13039\/501100007957","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002867","name":"Chongqing University of Arts and Sciences","doi-asserted-by":"crossref","award":["P2022SX09"],"award-info":[{"award-number":["P2022SX09"]}],"id":[{"id":"10.13039\/501100002867","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,12]]},"DOI":"10.1007\/s00373-025-02995-6","type":"journal-article","created":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T01:45:19Z","timestamp":1764294319000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper-embeddability and the decycling number of connected 4-regular graphs"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6050-5559","authenticated-orcid":false,"given":"Shude","family":"Long","sequence":"first","affiliation":[]},{"given":"Junliang","family":"Cai","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,28]]},"reference":[{"key":"2995_CR1","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/jgt.1028","volume":"38","author":"N Alon","year":"2001","unstructured":"Alon, N., Mubayi, D., Thomas, R.: Large induced forests in sparse graphs. J. Graph Theory 38, 113\u2013123 (2001)","journal-title":"J. Graph Theory"},{"key":"2995_CR2","first-page":"285","volume":"25","author":"S Bau","year":"2002","unstructured":"Bau, S., Beineke, L.W.: The decycling number of graphs. Austral J. Combin. 25, 285\u2013298 (2002)","journal-title":"Austral J. Combin."},{"key":"2995_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-H","volume":"25","author":"LW Beineke","year":"1996","unstructured":"Beineke, L.W., Vandell, R.C.: Decycling graphs. J. Graph Theory 25, 59\u201377 (1996)","journal-title":"J. Graph Theory"},{"key":"2995_CR4","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory With Applications, Macmillan, (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"key":"2995_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.dam.2016.06.011","volume":"214","author":"F Dross","year":"2016","unstructured":"Dross, F., Montassier, M., Pinlou, A.: A lower bound on the order of the largest induced forest in planar graphs with high girth. Discrete Appl. Math. 214, 99\u2013107 (2016)","journal-title":"Discrete Appl. Math."},{"key":"2995_CR6","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1017\/S0963548307008905","volume":"17","author":"C Hoppen","year":"2008","unstructured":"Hoppen, C., Wormald, N.: Induced forests in regular graphs with large girth. Combin. Probab. Comput. 17, 389\u2013410 (2008)","journal-title":"Combin. Probab. Comput."},{"key":"2995_CR7","first-page":"401","volume":"241","author":"M Jungerman","year":"1978","unstructured":"Jungerman, M.: A characterization of upper-embeddable graphs. Trans. Amer. Math. Soc. 241, 401\u2013408 (1978)","journal-title":"Trans. Amer. Math. Soc."},{"key":"2995_CR8","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems, Complexity of Computer Computations (Eds. R.E. Miller and J.W. Thatcher), Plenum Press, 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"2995_CR9","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/jgt.22361","volume":"89","author":"T Kelly","year":"2018","unstructured":"Kelly, T., Liu, C.H.: Size of the largest induced forest in subcubic graphs of girth at least four and five. J. Graph Theory 89, 457\u2013478 (2018)","journal-title":"J. Graph Theory"},{"key":"2995_CR10","first-page":"87","volume":"12","author":"\u0141 Kowalik","year":"2010","unstructured":"Kowalik, \u0141, Lu\u017ear, B., \u0160krekovski, R.: An improved bound on the largest induced forests for triangle-free planar graphs. Discrete Math. and Theor. Comput. Sci. 12, 87\u2013100 (2010)","journal-title":"Discrete Math. and Theor. Comput. Sci."},{"key":"2995_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(94)00268-N","volume":"184","author":"JP Liu","year":"1996","unstructured":"Liu, J.P., Zhao, C.: A new bound on the feedback vertex sets in cubic graphs. Discrete Math. 184, 119\u2013131 (1996)","journal-title":"Discrete Math."},{"key":"2995_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/jgt.22218","volume":"88","author":"SD Long","year":"2018","unstructured":"Long, S.D., Ren, H.: The decycling number and maximum genus of cubic graph. J. Graph Theory 88, 375\u2013384 (2018)","journal-title":"J. Graph Theory"},{"key":"2995_CR13","first-page":"147","volume":"32","author":"N Punnim","year":"2005","unstructured":"Punnim, N.: Decycling regular graphs. Austral J. Combin. 32, 147\u2013162 (2005)","journal-title":"Austral J. Combin."},{"key":"2995_CR14","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1016\/j.disc.2017.07.011","volume":"340","author":"H Ren","year":"2017","unstructured":"Ren, H., Yang, C., Zhao, T.X.: A new formula for the decycling number of regular graph. Disctere Math. 340, 3020\u20133031 (2017)","journal-title":"Disctere Math."},{"key":"2995_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1002\/jgt.3190120311","volume":"12","author":"E Speckenmeyer","year":"1988","unstructured":"Speckenmeyer, E.: On feedback vertex sets and nonseparating independent sets in cubic graphs. J. Graph Theory 12, 405\u2013412 (1988)","journal-title":"J. Graph Theory"},{"key":"2995_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0012-365X(84)90115-8","volume":"49","author":"W Staton","year":"1984","unstructured":"Staton, W.: Induced forests in cubic graphs. Discrete Math. 49, 175\u2013178 (1984)","journal-title":"Discrete Math."},{"key":"2995_CR17","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0012-365X(88)90226-9","volume":"72","author":"S Ueno","year":"1988","unstructured":"Ueno, S., Kajitani, Y., Gotoh, S.: On the nonseparating independent set problem and feedback vertex set problem for graphs with no vertex degree exceeding three. Discrete Math. 72, 355\u2013360 (1988)","journal-title":"Discrete Math."},{"key":"2995_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0095-8956(79)90058-3","volume":"26","author":"NH Xuong","year":"1979","unstructured":"Xuong, N.H.: How to determine the maximum genus of a graph. J. Combin. Theory Ser. B 26, 217\u2013225 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2995_CR19","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0012-365X(90)90165-E","volume":"85","author":"M Zheng","year":"1990","unstructured":"Zheng, M., Lu, X.: On the maximum induced forests of a connected cubic graph without triangles. Discrete Math. 85, 89\u201396 (1990)","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-02995-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02995-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02995-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:21Z","timestamp":1765164021000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02995-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,28]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2995"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02995-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,11,28]]},"assertion":[{"value":"23 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 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":"On behalf of all authors, the corresponding author states there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"132"}}