Surviving rates of graphs with bounded treewidth for the firefighter problem

DOI10.1137/100791130MaRDI QIDQ3013133zbMATH OpenOpenAlexFDO

Authors Leizhen Cai, Yongxi Cheng, Elad Verbin, Yuan Zhou

Publication date 18 July 2011

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/100791130

zbMATH Keywords

treetreewidthouterplanar graphfirefighter problemsurviving rate

Mathematics Subject Classification ID

Applications of graph theory (05C90) Extremal problems in graph theory (05C35)

Recommendations

• The surviving rate of a graph for the firefighter problem
• The surviving rate of an outerplanar graph for the firefighter problem
• Asymptotic surviving rate of trees with multiple fire sources
• Surviving rate of graphs and firefighter problem
• The edge surviving rate of a class of planar graphs for the firefighter problem

Cited in

(23)

• The 2-surviving rate of planar graphs without 6-cycles
• Surviving rate of graphs and firefighter problem
• The surviving rate of a graph for the firefighter problem
• The surviving rate of planar graphs without short cycles
• The 2-surviving rate of planar graphs without 5-cycles
• Surviving rate of graphs and firefighter problem
• The surviving rate of digraphs
• The 2-surviving rate of planar graphs without 4-cycles
• Fighting constrained fires in graphs
• The firefighter problem on graph classes
• The surviving rate of an outerplanar graph for the firefighter problem
• More fires and more fighters
• Planar graphs without chordal 5-cycles are 2-good
• Plane graphs of diameter two are 2-optimal
• The surviving rate of planar graphs
• Firefighting as a strategic game
• Firefighting on square, hexagonal, and triangular grids
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• Asymptotic surviving rate of trees with multiple fire sources
• The firefighter problem: empirical results on random graphs
• A note on the surviving rate of 1-planar graphs
• A lower bound of the surviving rate of a planar graph with girth at least seven
• Slash and burn on graphs -- firefighting with general weights

This page was built for publication: Surviving rates of graphs with bounded treewidth for the firefighter problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3013133)