Planar graph is on fire

  title={Planar graph is on fire},
  author={Przemyslaw Gordinowicz},
  journal={Theor. Comput. Sci.},
Let G be any connected graph on n vertices, n ≥ 2. Let k be any positive integer. Suppose that a fire breaks out on some vertex of G. Then in each turn k firefighters can protect vertices of G — each can protect one vertex not yet on fire; Next a fire spreads to all unprotected neighbours. The k-surviving rate of G, denoted by ρ k (G), is the expected fraction of vertices that can be saved from the fire by k firefighters, provided that the starting vertex is chosen uniformly at random. In this… CONTINUE READING
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 10 references

Firefighter! An application of domination, Presentation at the 25th Manitoba Conference on Combinatorial Mathematics and Computing

  • B Hartnell
  • Firefighter! An application of domination…
  • 1995
Highly Influential
1 Excerpt

Similar Papers

Loading similar papers…