{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:52Z","timestamp":1771036372404,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T00:00:00Z","timestamp":1535328000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T00:00:00Z","timestamp":1535328000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation","award":["CCF-1252833"],"award-info":[{"award-number":["CCF-1252833"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00373-018-1944-2","type":"journal-article","created":{"date-parts":[[2018,8,27]],"date-time":"2018-08-27T05:41:31Z","timestamp":1535348491000},"page":"1217-1246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Better Bound on the Largest Induced Forests in Triangle-Free Planar Graph"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8223-9944","authenticated-orcid":false,"given":"Hung","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"issue":"3","key":"1944_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01788541","volume":"1","author":"J Akiyama","year":"1987","unstructured":"Akiyama, J., Watanabe, M.: Maximum iduced forests of planar graphs. Graphs Comb. 1(3), 201\u2013202 (1987)","journal-title":"Graphs Comb."},{"key":"1944_CR2","unstructured":"Albertson, M.O., Berman, D.M.: A conjecture on planar graphs. In: Bondy, J.A., Murty, U.S.R. (eds.) Graph Theory and Related Topics, p. 357. Academic Press (1979)"},{"issue":"3","key":"1944_CR3","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(3), 113\u2013123 (2001)","journal-title":"J. Graph Theory"},{"issue":"3","key":"1944_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(79)90077-3","volume":"25","author":"OV Borodin","year":"1979","unstructured":"Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Math. 25(3), 211\u2013236 (1979)","journal-title":"Discrete Math."},{"key":"1944_CR5","unstructured":"Cranston, D.W., West, D.B.: A guide to the discharging method (2013). \n                    arXiv:1306.4434"},{"key":"1944_CR6","unstructured":"Dross, F., Montassier, M., Pinlou, A.: Large induced forests in planar graphs with girth 4 or 5 (2014). \n                    arXiv:1409.1348"},{"key":"1944_CR7","unstructured":"Kelly, T., Liu, C.: Size of the largest induced forest in subcubic graphs of girth at least four and five (2016). \n                    arXiv:1603.03855"},{"issue":"1","key":"1944_CR8","first-page":"87","volume":"12","author":"L Kowalik","year":"2010","unstructured":"Kowalik, L., Lu\u017ear, B., \u0160krekovski, R.: An improved bound on the largest induced forests for triangle-free planar graphs. Discrete Math. Theor. Comput. Sci. 12(1), 87\u2013100 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"1944_CR9","first-page":"P1","volume":"22","author":"R Lukot\u2019ka","year":"2015","unstructured":"Lukot\u2019ka, R., Maz\u00e1k, J., Zhu, X.: Maximum 4-degenerate subgraph of a planar graph. Electron. J. Comb. 22(1), P1\u2013P11 (2015)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"1944_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00373-006-0642-7","volume":"22","author":"MR Salavatipour","year":"2006","unstructured":"Salavatipour, M.R.: Large induced forests in triangle-free planar graphs. Graphs Comb. 22(1), 113\u2013126 (2006)","journal-title":"Graphs Comb."},{"key":"1944_CR11","unstructured":"Wang, Y., Xie, Q., Yu, X.: Induced forests in bipartite planar graphs (2016). \n                    arXiv:1605.00047"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1944-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1944-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1944-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:32:30Z","timestamp":1589445150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1944-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,27]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["1944"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1944-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,27]]},"assertion":[{"value":"10 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}