References
- CockayneE.J., HedetniemiS.T., Towards a theory of domination in graphs, Networks, 7 1977 247–261
- ChangG.J., The domatic number problem, Discrete Math., 125 1994 115–122
- LuT.L., HoP.H., ChangG.J., The domatic number problem in interval graphs, SIAM J. Discrete Math., 3 1990 531–536
- ManacherG.K., MankusT.A., Finding a domatic partition of an interval graph in time O(n), SIAM J. Discrete Math., 9 1996 167–172
- PengS.L., ChangM.S., A simple linear time algorithm for the domatic partition problem on strongly chordal graphs, Inform. Process. Lett., 43 1992 297–300
- RaoA.S., Pandu RanganC., Linear algorithm for domatic number problem on interval graphs, Inform. Process. Lett., 33 1989-1990 29–33
- ZelinkaB., On k-domatic numbers of a graph, Czechoslovak Math. J., 33 1983 309–313
- ZelinkaB., Domatically critical graphs, Czechoslovak Math. J., 30 1980 486–489
- ZelinkaB., Domatic number and linear arboricity of cacti, Math. Slovaca, 36 1986 41–54
- HedetniemiJ.T., HedetniemiS.T., The transitivity of a graph, J. Combin. Math. Combin. Comput., 104 2018 75–91
- HaynesT.W., HedetniemiS.T., SlaterP.J., Fundamentals of Domination in Graphs 1998Marcel Dekker New York
- GoddardW., HedetniemiS.M., HedetniemiS.T., McRaeA.A., The algorithmic complexity of domination digraphs, J. Combin. Math. Combin. Comput., 80 2012 367–384
- HaynesT.W., HedetniemiJ.T., HedetniemiS.T., McRaeA.A., PhillipsN., The transitivity of special graph classes, J. Combin. Math. Combin. Comput.2018 (in press)