The edge surviving rate of a class of planar graphs for the firefighter problem
From MaRDI portal
Publication:2993500
DOI10.6043/J.ISSN.0438-0479.2015.06.019zbMATH Open1349.05075MaRDI QIDQ2993500FDOQ2993500
Authors: Jiangxu Kong, Lianzhu Zhang
Publication date: 10 August 2016
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)
Cited In (14)
- Surviving rate of graphs and firefighter problem
- The 2-surviving rate of planar graphs without 5-cycles
- The 2-surviving rate of planar graphs without 6-cycles
- Planar graph is on fire
- The 2-surviving rate of planar graphs without 4-cycles
- The surviving rate of planar graphs
- The surviving rate of an outerplanar graph for the firefighter problem
- The surviving rate of a graph for the firefighter problem
- Surviving rates of graphs with bounded treewidth for the firefighter problem
- A lower bound of the surviving rate of a planar graph with girth at least seven
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
- The surviving rate of planar graphs without short cycles
- Structural properties and surviving rate of planar graphs
- A note on the surviving rate of 1-planar graphs
This page was built for publication: The edge surviving rate of a class of planar graphs for the firefighter problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993500)