{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T12:29:37Z","timestamp":1722428977187},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,1,29]],"date-time":"2018-01-29T00:00:00Z","timestamp":1517184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10878-017-0243-9","type":"journal-article","created":{"date-parts":[[2018,1,29]],"date-time":"2018-01-29T14:42:19Z","timestamp":1517236939000},"page":"980-996","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Planar graphs without chordal 5-cycles are 2-good"],"prefix":"10.1007","volume":"35","author":[{"given":"Weifan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingting","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxue","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiqiao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,29]]},"reference":[{"key":"243_CR1","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1016\/j.dam.2012.11.011","volume":"161","author":"C Bazgan","year":"2013","unstructured":"Bazgan C, Chopin M, Ries B (2013) The firefighter problem with more than one firefighter on trees. Discrete Appl Math 161:899\u2013908","journal-title":"Discrete Appl Math"},{"key":"243_CR2","first-page":"1814","volume":"23","author":"L Cai","year":"2009","unstructured":"Cai L, Wang W (2009) The surviving rate of a graph for the firefighter problem. SIAM J Discrete Math 23:1814\u20131826","journal-title":"SIAM J Discrete Math"},{"key":"243_CR3","doi-asserted-by":"publisher","first-page":"1322","DOI":"10.1137\/100791130","volume":"24","author":"L Cai","year":"2010","unstructured":"Cai L, Cheng Y, Verbin E, Zhou Y (2010) Surviving rates of graphs with bounded treewidth for the firefighter problem. SIAM J Discrete Math 24:1322\u20131335","journal-title":"SIAM J Discrete Math"},{"key":"243_CR4","doi-asserted-by":"publisher","first-page":"2410","DOI":"10.1016\/j.dam.2013.04.008","volume":"161","author":"V Costa","year":"2013","unstructured":"Costa V, Dantas S, Dourado MC, Penso L, Rautenbach D (2013) More fires and more fighters. Discrete Appl Math 161:2410\u20132419","journal-title":"Discrete Appl Math"},{"key":"243_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jgt.21673","volume":"73","author":"L Esperet","year":"2013","unstructured":"Esperet L, van den Heuvel J, Maffray F, Sipma F (2013) Fire containment in planar graphs. J Graph Theory 73:267\u2013279","journal-title":"J Graph Theory"},{"key":"243_CR6","first-page":"57","volume":"43","author":"S Finbow","year":"2009","unstructured":"Finbow S, MacGillivray G (2009) The firefighter problem: a survey of results, directions and questions. Australas J Comb 43:57\u201377","journal-title":"Australas J Comb"},{"key":"243_CR7","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1016\/j.disc.2005.12.053","volume":"307","author":"S Finbow","year":"2007","unstructured":"Finbow S, King A, MacGillivray G, Rizzi R (2007) The firefighter problem for graphs of maximum degree three. Discrete Math 307:2094\u20132105","journal-title":"Discrete Math"},{"key":"243_CR8","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.tcs.2015.06.002","volume":"593","author":"P Gordinowicz","year":"2015","unstructured":"Gordinowicz P (2015) Planar graph is on fire. Theor Comput Sci 593:160\u2013164","journal-title":"Theor Comput Sci"},{"issue":"1","key":"243_CR9","doi-asserted-by":"publisher","first-page":"1750011","DOI":"10.1142\/S1793830917500112","volume":"9","author":"J Jin","year":"2017","unstructured":"Jin J, Wei Y (2017) A note on 3-choosability of plane graphs under distance restrictions. Discrete Math Algorithms Appl 9(1):1750011","journal-title":"Discrete Math Algorithms Appl"},{"issue":"3","key":"243_CR10","doi-asserted-by":"publisher","first-page":"1750031","DOI":"10.1142\/S1793830917500318","volume":"9","author":"N Karst","year":"2017","unstructured":"Karst N, Langowitz J, Oehrlein J, Troxell DS (2017) Radio k-chromatic number of cycles for large $k$. Discrete Math Algorithms Appl 9(3):1750031","journal-title":"Discrete Math Algorithms Appl"},{"key":"243_CR11","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.disc.2009.05.007","volume":"310","author":"A King","year":"2010","unstructured":"King A, MacGillivray G (2010) The firefighter problem for cubic graphs. Discrete Math 310:614\u2013621","journal-title":"Discrete Math"},{"key":"243_CR12","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2011.10.002","volume":"416","author":"J Kong","year":"2012","unstructured":"Kong J, Wang W, Zhu X (2012) The surviving rate of planar graphs. Theor Comput Sci 416:65\u201370","journal-title":"Theor Comput Sci"},{"issue":"4","key":"243_CR13","doi-asserted-by":"publisher","first-page":"1450052","DOI":"10.1142\/S1793830914500529","volume":"6","author":"J Kong","year":"2014","unstructured":"Kong J, Zhang L, Wang W (2014) Structural properties and surviving rate of planar graphs. Discrete Math Algorithms Appl 6(4):1450052","journal-title":"Discrete Math Algorithms Appl"},{"key":"243_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"RJ Lipton","year":"1979","unstructured":"Lipton RJ, Tarjan RE (1979) A separate theorem for planar graphs. SIAM J Appl Math 36:177\u2013189","journal-title":"SIAM J Appl Math"},{"key":"243_CR15","doi-asserted-by":"crossref","first-page":"2157","DOI":"10.1137\/120876113","volume":"27","author":"P Pra\u0142at","year":"2014","unstructured":"Pra\u0142at P (2014) Sparse graphs are not flammable. SIAM J Discrete Math 27:2157\u20132166","journal-title":"SIAM J Discrete Math"},{"issue":"4","key":"243_CR16","doi-asserted-by":"publisher","first-page":"1750054","DOI":"10.1142\/S1793830917500549","volume":"9","author":"NK Sudev","year":"2017","unstructured":"Sudev NK, Chithra KP, Satheesh S, Kok J (2017) On certain parameters of equitable coloring of graphs. Discrete Math Algorithms Appl 9(4):1750054","journal-title":"Discrete Math Algorithms Appl"},{"issue":"5","key":"243_CR17","doi-asserted-by":"publisher","first-page":"1750069","DOI":"10.1142\/S1793830917500690","volume":"9","author":"R Vasanthi","year":"2017","unstructured":"Vasanthi R, Subramanian K (2017) On the minimum vertex coloring transversal dominating sets in graphs and their classifications. Discrete Math Algorithms Appl 9(5):1750069","journal-title":"Discrete Math Algorithms Appl"},{"key":"243_CR18","doi-asserted-by":"publisher","first-page":"3651","DOI":"10.1016\/j.tcs.2010.06.009","volume":"411","author":"W Wang","year":"2010","unstructured":"Wang W, Finbow S, Wang P (2010) The surviving rate of an infected network. Theor Comput Sci 411:3651\u20133660","journal-title":"Theor Comput Sci"},{"key":"243_CR19","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.tcs.2012.07.011","volume":"457","author":"W Wang","year":"2012","unstructured":"Wang W, Kong J, Zhang L (2012) The 2-surviving rate of planar graphs without 4-cycles. Theor Comput Sci 457:158\u2013165","journal-title":"Theor Comput Sci"},{"key":"243_CR20","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/s10878-012-9541-4","volume":"27","author":"W Wang","year":"2014","unstructured":"Wang W, Finbow S, Wang P (2014a) A lower bound of the surviving rate of a planar graph with girth at least seven. J Comb Optim 27:621\u2013642","journal-title":"J Comb Optim"},{"key":"243_CR21","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.tcs.2013.05.025","volume":"518","author":"W Wang","year":"2014","unstructured":"Wang W, Finbow S, Kong J (2014b) The 2-surviving rate of planar graphs without 6-cycles. Theor Comput Sci 518:22\u201331","journal-title":"Theor Comput Sci"},{"key":"243_CR22","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1007\/s10878-015-9835-4","volume":"31","author":"T Wu","year":"2016","unstructured":"Wu T, Kong J, Wang W (2016) The 2-surviving rate of planar graphs without 5-cycles. J Comb Optim 31:1479\u20131492","journal-title":"J Comb Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0243-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0243-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0243-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T02:01:08Z","timestamp":1548727268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0243-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,29]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["243"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0243-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,29]]},"assertion":[{"value":"29 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}