The following pages link to Fire Containment in Planar Graphs (Q5325939):
Displaying 13 items.
- The 2-surviving rate of planar graphs without 5-cycles (Q281784) (← links)
- The firefighter problem: empirical results on random graphs (Q337557) (← links)
- The 2-surviving rate of planar graphs without 6-cycles (Q391779) (← links)
- The surviving rate of digraphs (Q396728) (← links)
- Planar graph is on fire (Q501009) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- A note on the surviving rate of 1-planar graphs (Q512598) (← links)
- The 2-surviving rate of planar graphs without 4-cycles (Q714853) (← links)
- Planar graphs without chordal 5-cycles are 2-good (Q1743499) (← links)
- Plane graphs of diameter two are 2-optimal (Q2101995) (← links)
- Surviving rate of graphs and firefighter problem (Q2141321) (← links)
- Structural properties and surviving rate of planar graphs (Q2931915) (← links)
- Firefighting as a Strategic Game (Q5856433) (← links)
