{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:38:12Z","timestamp":1774334292290,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":41,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_13","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:00Z","timestamp":1770977220000},"page":"187-202","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Large Induced Subgraphs of\u00a0Bounded Degree in\u00a0Outerplanar and\u00a0Planar Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-6266-3324","authenticated-orcid":false,"given":"Marco","family":"D\u2019Elia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5987-8713","authenticated-orcid":false,"given":"Fabrizio","family":"Frati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01788541","volume":"3","author":"J Akiyama","year":"1987","unstructured":"Akiyama, J., Watanabe, M.: Maximum induced forests of planar graphs. Graphs Comb. 3(1), 201\u2013202 (1987)","journal-title":"Graphs Comb."},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/0095-8956(76)90071-X","volume":"20","author":"MO Albertson","year":"1976","unstructured":"Albertson, M.O.: A lower bound for the independence number of a planar graph. J. Comb. Th. Ser. B 20(1), 84\u201393 (1976)","journal-title":"J. Comb. Th. Ser. B"},{"key":"13_CR3","unstructured":"Albertson, M.O., Berman, D.M.: A conjecture on planar graphs. Graph theory and related topics, p.\u00a0357 (1979)"},{"issue":"3","key":"13_CR4","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 Th. 38(3), 113\u2013123 (2001)","journal-title":"J. Graph Th."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/jgt.21884","volume":"82","author":"P Angelini","year":"2016","unstructured":"Angelini, P., Evans, W.S., Frati, F., Gudmundsson, J.: SEFE without mapping via large induced outerplane graphs in plane graphs. J. Graph Th. 82(1), 45\u201364 (2016)","journal-title":"J. Graph Th."},{"issue":"3","key":"13_CR6","first-page":"429","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. I. Discharging. Illinois J. Math. 21(3), 429\u2013490 (1977)","journal-title":"I. Discharging. Illinois J. Math."},{"issue":"3","key":"13_CR7","first-page":"491","volume":"21","author":"K Appel","year":"1977","unstructured":"Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. II. Reducibility. Illinois J. Math. 21(3), 491\u2013567 (1977)","journal-title":"II. Reducibility. Illinois J. Math."},{"issue":"3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00224-005-1139-0","volume":"38","author":"T Biedl","year":"2005","unstructured":"Biedl, T., Wilkinson, D.F.: Bounded-degree independent sets in planar graphs. Theory Comput. Syst. 38(3), 253\u2013278 (2005)","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.4153\/CMB-1987-028-5","volume":"30","author":"JA Bondy","year":"1987","unstructured":"Bondy, J.A., Hopkins, G., Staton, W.: Lower bounds for induced forests in cubic graphs. Canad. Math. Bull. 30(2), 175\u2013178 (1987)","journal-title":"Canad. Math. Bull."},{"issue":"3","key":"13_CR10","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. Discret. Math. 25(3), 211\u2013236 (1979)","journal-title":"Discret. Math."},{"issue":"6","key":"13_CR11","doi-asserted-by":"publisher","first-page":"1621","DOI":"10.1007\/s00373-017-1859-3","volume":"33","author":"G Borradaile","year":"2017","unstructured":"Borradaile, G., Le, H., Sherman-Bennett, M.: Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph. Graphs Comb. 33(6), 1621\u20131634 (2017)","journal-title":"Graphs Comb."},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Bose, P., Dujmovic, V., Wood, D.R.: Induced subgraphs of bounded degree and bounded treewidth. Contributions Discret. Math. 1(1) (2006)","DOI":"10.55016\/ojs\/cdm.v1i1.61915"},{"key":"13_CR13","first-page":"167","volume":"20","author":"Y Caro","year":"1985","unstructured":"Caro, Y., Roditty, Y.: On the vertex-independence number and star decomposition of graphs. Ars Combin. 20, 167\u2013180 (1985)","journal-title":"Ars Combin."},{"issue":"4","key":"13_CR14","doi-asserted-by":"publisher","first-page":"8","DOI":"10.37236\/3826","volume":"20","author":"GG Chappell","year":"2013","unstructured":"Chappell, G.G., Pelsmajer, M.J.: Maximum induced forests in graphs of bounded treewidth. Electron. J. Comb. 20(4), 8 (2013)","journal-title":"Electron. J. Comb."},{"issue":"2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"LJ Cowen","year":"1986","unstructured":"Cowen, L.J., Cowen, R., Woodall, D.R.: Defective colorings of graphs in surfaces: Partitions into subgraphs of bounded valency. J. Graph Th. 10(2), 187\u2013195 (1986)","journal-title":"J. Graph Th."},{"key":"13_CR16","unstructured":"D\u2019Elia, M., Frati, F.: Large induced subgraphs of bounded degree in outerplanar and planar graphs. CoRR abs\/2412.14784 (2024)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, 4th edn, vol.\u00a0173. Springer (2012)","DOI":"10.1007\/978-3-662-53622-3_7"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.dam.2018.06.029","volume":"254","author":"F Dross","year":"2019","unstructured":"Dross, F., Montassier, M., Pinlou, A.: Large induced forests in planar graphs with girth 4. Discret. Appl. Math. 254, 96\u2013106 (2019)","journal-title":"Discret. Appl. Math."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.disc.2018.11.023","volume":"342","author":"F Dross","year":"2019","unstructured":"Dross, F., Montassier, M., Pinlou, A.: A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Disc. Math. 342, 943\u2013950 (2019)","journal-title":"Disc. Math."},{"issue":"1","key":"13_CR20","first-page":"1","volume":"25","author":"Z Dvor\u00e1k","year":"2018","unstructured":"Dvor\u00e1k, Z., Kelly, T.: Induced 2-degenerate subgraphs of triangle-free planar graphs. Electron. J. Comb. 25(1), 1 (2018)","journal-title":"Electron. J. Comb."},{"issue":"3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(02)00265-X","volume":"84","author":"G Fertin","year":"2002","unstructured":"Fertin, G., Godard, E., Raspaud, A.: Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84(3), 131\u2013139 (2002)","journal-title":"Inf. Process. Lett."},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Fountoulakis, N., Kang, R.J., McDiarmid, C.: The t-stability number of a random graph. Electron. J. Comb. 17(1) (2010)","DOI":"10.37236\/331"},{"issue":"2","key":"13_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1002\/jgt.22740","volume":"99","author":"Y Gu","year":"2022","unstructured":"Gu, Y., Kierstead, H.A., Oum, S., Qi, H., Zhu, X.: 3-degenerate induced subgraph of a planar graph. J. Graph Th. 99(2), 251\u2013277 (2022)","journal-title":"J. Graph Th."},{"key":"13_CR24","first-page":"27","volume":"25","author":"K Hosono","year":"1990","unstructured":"Hosono, K.: Induced forests in trees and outerplanar graphs. Proc. Faculty Sci. Tokai Univ. 25, 27\u201329 (1990)","journal-title":"Proc. Faculty Sci. Tokai Univ."},{"issue":"4","key":"13_CR25","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1002\/jgt.22361","volume":"89","author":"T Kelly","year":"2018","unstructured":"Kelly, T., Liu, C.: Size of the largest induced forest in subcubic graphs of girth at least four and five. J. Graph Th. 89(4), 457\u2013478 (2018)","journal-title":"J. Graph Th."},{"issue":"1","key":"13_CR26","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"13_CR27","unstructured":"Knauer, K., Ueckerdt, T.: Clustered independence and bounded treewidth. CoRR abs\/2303.13655 (2023)"},{"key":"13_CR28","first-page":"87","volume":"12","author":"L Kowalik","year":"2010","unstructured":"Kowalik, L., Luzar, B., Skrekovski, R.: An improved bound on the largest induced forests for triangle-free planar graphs. Disc. Math. Th. Comp. Sc. 12, 87\u2013100 (2010)","journal-title":"Disc. Math. Th. Comp. Sc."},{"issue":"6","key":"13_CR29","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1007\/s00373-018-1944-2","volume":"34","author":"H Le","year":"2018","unstructured":"Le, H.: A better bound on the largest induced forests in triangle-free planar graph. Graphs Comb. 34(6), 1217\u20131246 (2018)","journal-title":"Graphs Comb."},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10587-004-6438-0","volume":"54","author":"H Liu","year":"2004","unstructured":"Liu, H., Sun, L.: On domination number of 4-regular graphs. Czechoslov. Math. J. 54, 889\u2013898 (2004)","journal-title":"Czechoslov. Math. J."},{"issue":"1","key":"13_CR31","first-page":"1","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), 1 (2015)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"13_CR32","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00373-003-0528-x","volume":"20","author":"MJ Pelsmajer","year":"2004","unstructured":"Pelsmajer, M.J.: Maximum induced linear forests in outerplanar graphs. Graphs Comb. 20(1), 121\u2013129 (2004)","journal-title":"Graphs Comb."},{"issue":"1","key":"13_CR33","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/jgt.3190140108","volume":"14","author":"KS Poh","year":"1990","unstructured":"Poh, K.S.: On the linear vertex-arboricity of a planar graph. J. Graph Th. 14(1), 73\u201375 (1990)","journal-title":"J. Graph Th."},{"issue":"1","key":"13_CR34","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jctb.1997.1750","volume":"70","author":"N Robertson","year":"1997","unstructured":"Robertson, N., Sanders, D.P., Seymour, P.D., Thomas, R.: The four-colour theorem. J. Comb. Theory B 70(1), 2\u201344 (1997)","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"13_CR35","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."},{"issue":"4","key":"13_CR36","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1002\/jgt.22104","volume":"85","author":"L Shi","year":"2017","unstructured":"Shi, L., Xu, H.: Large induced forests in graphs. J. Graph Th. 85(4), 759\u2013779 (2017)","journal-title":"J. Graph Th."},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Snoeyink, J., van Kreveld, M.J.: Linear-time reconstruction of Delaunay triangulations with applications. In: Burkard, R., Woeginger, G. (eds.) 5th European Symposium on Algorithms (ESA 1997). LNCS, vol.\u00a01284, pp. 459\u2013471. Springer (1997)","DOI":"10.1007\/3-540-63397-9_35"},{"issue":"2","key":"13_CR38","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. Discret. Math. 49(2), 175\u2013178 (1984)","journal-title":"Discret. Math."},{"issue":"1","key":"13_CR39","first-page":"93","volume":"8","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Xie, Q., Yu, X.: Induced forests in bipartite planar graphs. J. Comb. 8(1), 93\u2013166 (2017)","journal-title":"J. Comb."},{"key":"13_CR40","doi-asserted-by":"crossref","unstructured":"Wood, D.R.: Defective and clustered graph colouring. Electron. J. Comb. #DS23, 1\u201371 (2018)","DOI":"10.37236\/7406"},{"key":"13_CR41","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1007\/s10587-006-0079-4","volume":"56","author":"HM Xing","year":"2006","unstructured":"Xing, H.M., Sun, L., Chen, X.G.: An upper bound for domination number of 5-regular graphs. Czechoslov. Math. J. 56, 1049\u20131061 (2006)","journal-title":"Czechoslov. Math. J."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:15:33Z","timestamp":1774325733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}