Fire Containment in Planar Graphs

DOI10.1002/jgt.21673zbMath1269.05026arXiv1102.3016OpenAlexW3123402719MaRDI QIDQ5325939

Félix Sipma, Jan van den Heuvel, Frédéric Maffray, Louis Esperet

Publication date: 31 July 2013

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.3016

zbMATH Keywords

planar graphssurviving ratethe firefighter problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (14)

The 2-surviving rate of planar graphs without 5-cycles ⋮ Surviving rate of graphs and firefighter problem ⋮ The firefighter problem: empirical results on random graphs ⋮ Structural properties and surviving rate of planar graphs ⋮ The 2-surviving rate of planar graphs without 6-cycles ⋮ The surviving rate of digraphs ⋮ Unnamed Item ⋮ Planar graph is on fire ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ An introduction to the discharging method via graph coloring ⋮ A note on the surviving rate of 1-planar graphs ⋮ The 2-surviving rate of planar graphs without 4-cycles ⋮ Firefighting as a Strategic Game ⋮ Plane graphs of diameter two are 2-optimal

Cites Work

• The surviving rate of an infected network
• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• The Surviving Rate of a Graph for the Firefighter Problem
• Unnamed Item

This page was built for publication: Fire Containment in Planar Graphs