Y. Caro and Y. Roditty, -domination number of a graph, International Journal of Mathematics and Mathematical Sciences, vol.13, issue.1, pp.205-206, 1990.
DOI : 10.1155/S016117129000031X
URL : https://hal.archives-ouvertes.fr/inria-00074744

E. J. Cockayne and S. T. Hedetniemi, Towards a theory of domination in graphs, Networks, vol.164, issue.3, pp.247-261, 1977.
DOI : 10.1002/net.3230070305

O. Favaron, A. Hansberg, and L. Volkmann, Onk-domination and minimum degree in graphs, Journal of Graph Theory, vol.17, issue.1, pp.33-40, 2008.
DOI : 10.1002/jgt.20279

U. Feige, M. M. Halldórsson, G. Kortsarz, and A. Srinivasan, Approximating the domatic number, Proceedings of the thirty-second annual ACM symposium on Theory of computing , STOC '00, pp.172-195, 2002.
DOI : 10.1145/335305.335321
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.2137

J. F. Fink and M. S. Jacobson, n-domination in graphs. Graph Theory with Applications to Algorithms and Computer Science, pp.282-300, 1985.

J. F. Fink and M. S. Jacobson, On n-domination, n-dependence and forbidden subgraphs. Graph Theory with Applications to Algorithms and Computer Science, pp.301-311, 1985.

J. Fujisawa, A. Hansberg, T. Kubo, A. Saito, M. Sugita et al., Independence and 2-domination in bipartite graphs, Australas. J. Combin, vol.40, pp.265-268, 2008.

S. Fujita, M. Yamashita, and T. Kameda, -Configurations---A Resource Assignment Problem on Graphs, SIAM Journal on Discrete Mathematics, vol.13, issue.2, pp.227-254, 2000.
DOI : 10.1137/S0895480196311328
URL : https://hal.archives-ouvertes.fr/hal-01200926

M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, 1979.

A. Hansberg, D. Meierling, and L. Volkmann, Distance domination and distance irredundance in graphs, Electron. J. Comb, vol.14, 2007.

T. W. Haynes, S. T. Hedetniemi, S. , and P. J. Slater, Domination in Graphs, 1998.
DOI : 10.1201/b16132-65

T. W. Haynes, S. T. Hedetniemi, S. , and P. J. Slater, Fundamentals of Domination in Graphs, 1998.

K. Islam, S. G. Akl, and H. Meijer, Maximizing the lifetime of wireless sensor networks through domatic partition, 2009 IEEE 34th Conference on Local Computer Networks, 2009.
DOI : 10.1109/LCN.2009.5355161

K. Kämmerling and L. Volkmann, The k-domatic number of a graph, Czechoslovak Mathematical Journal, vol.59, issue.2, pp.539-550, 2009.
DOI : 10.1007/s10587-009-0036-0

A. Meir and J. W. Moon, Relations between packing and covering numbers of a tree, Pacific Journal of Mathematics, vol.61, issue.1, pp.225-233, 1975.
DOI : 10.2140/pjm.1975.61.225

R. Misra and C. Mandal, domatic partition in self-organizing sensor networks, Wireless Communications and Mobile Computing, vol.14, issue.5, pp.1040-1058, 2009.
DOI : 10.1002/9781118033203

S. V. Pemmaraju and I. A. Pirwani, Energy conservation via domatic partitions, Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing , MobiHoc '06, 2006.
DOI : 10.1145/1132905.1132922
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.117.5035

R. Pepper, Implications of some observations about the k-domination number, Congr. Numer, vol.206, pp.65-71, 2010.

D. Rautenbach and L. Volkmann, New bounds on the <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-domination number and the <mml:math altimg="si2.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-tuple domination number, Applied Mathematics Letters, vol.20, issue.1, pp.98-102, 2007.
DOI : 10.1016/j.aml.2006.03.006

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

B. Zelinka, On k-ply domatic numbers of graphs, Math. Slovaca, vol.34, issue.3, pp.313-318, 1984.