The 2-surviving rate of planar graphs without 5-cycles

DOI10.1007/S10878-015-9835-4zbMath1369.90182OpenAlexW2035741617MaRDI QIDQ281784

Tingting Wu, Jiangxu Kong, Wei Fan Wang

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9835-4

zbMATH Keywords

cycleplanar graphfirefighter problemsurviving rate

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (4)

Surviving rate of graphs and firefighter problem ⋮ Unnamed Item ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ A note on the surviving rate of 1-planar graphs

Cites Work

• Unnamed Item
• The 2-surviving rate of planar graphs without 6-cycles
• Planar graph is on fire
• The surviving rate of an infected network
• The 2-surviving rate of planar graphs without 4-cycles
• The surviving rate of planar graphs
• The firefighter problem for cubic graphs
• The firefighter problem with more than one firefighter on trees
• A lower bound of the surviving rate of a planar graph with girth at least seven
• The firefighter problem for graphs of maximum degree three
• More fires and more fighters
• Structural properties and surviving rate of planar graphs
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• The Surviving Rate of a Graph for the Firefighter Problem
• A Separator Theorem for Planar Graphs
• Fire Containment in Planar Graphs
• Sparse Graphs Are Not Flammable

This page was built for publication: The 2-surviving rate of planar graphs without 5-cycles