1 |
J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier Publishing Co., Inc., New York, 1976.
|
2 |
R. L. Brooks, On colouring the nodes of a network, Proc. Cambridge Philos. Soc. 37 (1941), 194-197.
DOI
|
3 |
L. Dekar, et al., [r, s, t]-coloring of trees and bipartite graphs, Discrete Math. (2008) doi:10.1016/j.disc.2008.09.021.
DOI
ScienceOn
|
4 |
S. L. Hakimi and O. Kariv, A generalization of edge-coloring in graphs, J. Graph Theory 10 (1986), no. 2, 139-154.
DOI
|
5 |
F. Havet and M. L. Yu, (p, 1)-total labelling of graphs, Discrete Math. 308 (2008), no. 4, 496-513.
DOI
ScienceOn
|
6 |
A. Kemnitz and M. Marangio, [r, s, t]-colorings of graphs, Discrete Math. 307 (2007), no. 2, 199-207.
DOI
ScienceOn
|
7 |
X. Zhang and G. Liu, The classification of complete graphs on f-coloring, J. Appl. Math. Comput. 19 (2005), no. 1-2, 127-133.
DOI
|
8 |
X. Zhang and G. Liu, Some sufficient conditions for a graph to be of 1, Appl. Math. Lett. 19 (2006), no. 1, 38-44.
DOI
ScienceOn
|
9 |
X. Zhang and G. Liu, Some graphs of class 1 for f-colorings, Appl. Math. Lett. 21 (2008), no. 1, 23-29.
DOI
ScienceOn
|