Planar graph is on fire
From MaRDI portal
Publication:501009
DOI10.1016/j.tcs.2015.06.002zbMath1331.05152arXiv1311.1158OpenAlexW1609723440MaRDI QIDQ501009
Publication date: 8 October 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.1158
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (7)
The 2-surviving rate of planar graphs without 5-cycles ⋮ Surviving rate of graphs and firefighter problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Planar graphs without chordal 5-cycles are 2-good ⋮ A note on the surviving rate of 1-planar graphs ⋮ Plane graphs of diameter two are 2-optimal
Cites Work
- Unnamed Item
- The 2-surviving rate of planar graphs without 4-cycles
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
- The surviving rate of planar graphs
- TOWARDS MORE EFFICIENT INFECTION AND FIRE FIGHTING
- 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: Planar graph is on fire
