Planar graphs without chordal 5-cycles are 2-good-Reference-Cited by-同舟云学术

Planar graphs without chordal 5-cycles are 2-good

Published:2018-01-29 Issue:3 Volume:35 Page:980-996
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Wang Weifan,Wu Tingting,Hu Xiaoxue,Wang Yiqiao

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10878-017-0243-9/fulltext.html

Reference22 articles.

1. Bazgan C, Chopin M, Ries B (2013) The firefighter problem with more than one firefighter on trees. Discrete Appl Math 161:899–908

2. Cai L, Wang W (2009) The surviving rate of a graph for the firefighter problem. SIAM J Discrete Math 23:1814–1826

3. 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–1335

4. Costa V, Dantas S, Dourado MC, Penso L, Rautenbach D (2013) More fires and more fighters. Discrete Appl Math 161:2410–2419

5. Esperet L, van den Heuvel J, Maffray F, Sipma F (2013) Fire containment in planar graphs. J Graph Theory 73:267–279

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Surviving Rate of IC-Planar Graphs;Symmetry;2022-06-17

2. Surviving rate of graphs and Firefighter Problem;Frontiers of Mathematics in China;2022-04

3. Optimal r-dynamic coloring of sparse graphs;Journal of Combinatorial Optimization;2019-02-27