The 2-surviving rate of planar graphs without 6-cycles
From MaRDI portal
Publication:391779
DOI10.1016/J.TCS.2013.05.025zbMath1370.05152OpenAlexW2916766399MaRDI QIDQ391779
Stephen Finbow, Jiangxu Kong, Wei Fan Wang
Publication date: 13 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.05.025
Planar graphs; geometric and topological aspects of graph theory (05C10) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (6)
The 2-surviving rate of planar graphs without 5-cycles ⋮ Surviving rate of graphs and firefighter problem ⋮ The surviving rate of digraphs ⋮ 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 surviving rate of an outerplanar graph for the firefighter problem
- 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 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 6-cycles