M. A. Axenovich, On multiple coverings of the infinite rectangular grid with balls of constant radius, Discrete Math, pp.31-48, 2003.

N. Biggs, Perfect codes in graphs, Journal of Combinatorial Theory, Series B, vol.15, issue.3, pp.289-296, 1973.
DOI : 10.1016/0095-8956(73)90042-7

G. Cohen, I. Honkala, S. Lytsin, H. F. Mattson, and J. , Weighted coverings and packings, Weighted covering and packings, pp.1856-1967, 1995.
DOI : 10.1109/18.476311
URL : http://surface.syr.edu/cgi/viewcontent.cgi?article=1147&context=eecs_techreports

P. Cull and I. Nelson, Error-correcting codes on the Towers of Hanoi graphs, Discrete Math, pp.157-175, 1999.

P. Dorbec, S. Gravier, I. Honkala, and M. Mollard, Weighted codes in Lee metrics, Designs, Codes and Cryptography, vol.1, issue.3, pp.209-218, 2009.
DOI : 10.1007/s10623-009-9277-z

J. Fiala, P. Heggernes, P. Kristiansen, and J. A. , Telle, Generalized H-coloring and H-covering of trees, Nordic J. Comput, vol.10, pp.206-224, 2003.

S. Gravier, S. Klav?ar, and M. Mollard, Codes and L(2, 1)-labelings in Sierpi´nskiSierpi´nski graphs, Taiwanese J. Math, vol.9, pp.671-681, 2005.

S. T. Hedetniemi, A. A. Mcrae, and D. A. Parks, Complexity results, Domination in Graphs: Advanced Topics, pp.233-269, 1998.

P. Heggernes and J. A. , Telle Partitioning graphs into generalized dominating sets, Nordic J. Comput, vol.5, pp.128-142, 1998.

M. Jakovac and S. Klav?ar, Vertex-, edge-, and total-colorings of Sierpi´nskiSierpi´nski-like graphs, Discrete Math, pp.1548-1556, 2009.

S. Klav?ar, Coloring Sierpi´nskiSierpi´nski graphs and Sierpi´nskiSierpi´nski gasket graphs, Taiwanese J. Math, vol.12, pp.513-522, 2008.

S. Klav?ar and U. Milutinovi´cmilutinovi´c, Graphs S(n, k) and a Variant of the Tower of Hanoi Problem, Czechoslovak Mathematical Journal, vol.47, issue.1, pp.95-104, 1997.
DOI : 10.1023/A:1022444205860

S. Klav?ar and U. , 1-perfect codes in Sierpi??ski graphs, Bulletin of the Australian Mathematical Society, vol.21, issue.03, pp.369-384, 2002.
DOI : 10.2307/2159369

S. Klav?ar and B. Mohar, Crossing numbers of Sierpi??ski-like graphs, Journal of Graph Theory, vol.104, issue.3, pp.186-198, 2005.
DOI : 10.1002/jgt.20107

C. Li and I. Nelson, Perfect codes on the towers of Hanoi graph, Bulletin of the Australian Mathematical Society, vol.6, issue.03, pp.367-376, 1998.
DOI : 10.2307/3606393

S. L. Lipscomb, Fractals and Universal Spaces in Dimension Theory, 2009.
DOI : 10.1007/978-0-387-85494-6

S. L. Lipscomb and J. C. Perry, Lipscomb's L(A) Space Fractalized in Hilbert's l 2 (A) Space, Proc. Amer, pp.115-1157, 1992.
DOI : 10.2307/2159369

U. Milutinovi´cmilutinovi´c, Completeness of the Lipscomb space, Glas. Mat. Ser. III, vol.27, issue.47, pp.343-364, 1992.

J. A. Telle, Complexity of domination-type problems in graphs, Nordic J. Comput, vol.1, pp.157-171, 1994.