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

DOI10.1016/J.TCS.2012.07.011zbMath1251.05042OpenAlexW1985532973MaRDI QIDQ714853

Jiangxu Kong, Lian Zhu Zhang, Wei Fan Wang

Publication date: 11 October 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.07.011

zbMATH Keywords

cycleplanar graphfirefighter problem2-surviving rate

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (13)

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 ⋮ Finding exact solutions for the geometric firefighter problem in practice ⋮ 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 ⋮ A note on the surviving rate of 1-planar graphs ⋮ Solving the geometric firefighter routing problem via integer programming ⋮ Firefighting as a Strategic Game ⋮ Asymptotic surviving rate of trees with multiple fire sources

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The surviving rate of an outerplanar graph for the firefighter problem
• The surviving rate of an infected network
• The surviving rate of planar graphs
• Allee effect and control of lake system invasion
• The firefighter problem for cubic graphs
• 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
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• The Surviving Rate of a Graph for the Firefighter Problem
• Fire Containment in Planar Graphs

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