D. P. Biebighauser, L. E. Holte, and R. M. Wagner, The firefighter problem for regular infinite directed grids, Involve, a Journal of Mathematics, vol.41, issue.4, pp.393-409, 2012.
DOI : 10.1016/j.dam.2007.08.011

V. Chvátal and C. Thomassen, Distances in orientations of graphs, Journal of Combinatorial Theory, Series B, vol.24, issue.1, pp.61-75, 1978.
DOI : 10.1016/0095-8956(78)90078-3

S. Finbow, A. King, G. Macgillivray, and R. Rizzi, The firefighter problem for graphs of maximum degree three, Discrete Mathematics, vol.307, issue.16, pp.2094-2105, 2007.
DOI : 10.1016/j.disc.2005.12.053

S. Finbow and G. Macgillivray, The firefighter problem: A survey of results , directions and questions, Australasian Journal of Combinatorics, vol.43, pp.57-77, 2009.

B. L. Hartnell, An application of domination, 25th Manitoba Conference on Combinatorial Mathematics and Computing, 1995.

A. King and G. Macgillivray, The firefighter problem for cubic graphs, Discrete Mathematics, vol.310, issue.3, pp.614-621, 2010.
DOI : 10.1016/j.disc.2009.05.007

J. Kong, L. Zhang, and W. Wang, The surviving rate of digraphs, Discrete Mathematics, vol.334, pp.13-19, 2014.
DOI : 10.1016/j.disc.2014.06.018

M. E. Messinger, Average firefighting on infinite grids, Australasian Journal of Combinatorics, vol.41, pp.15-28, 2008.

W. Schnyder, Embedding planar graphs on the grid, Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, pp.138-148, 1990.