[r, s, t; f]-COLORING OF GRAPHS

Title & Authors
[r, s, t; f]-COLORING OF GRAPHS
Yu, Yong; Liu, Guizhen;

Abstract
Let f be a function which assigns a positive integer f(v) to each vertex v $\small{\in}$ V (G), let r, s and t be non-negative integers. An f-coloring of G is an edge-coloring of G such that each vertex v $\small{\in}$ V (G) has at most f(v) incident edges colored with the same color. The minimum number of colors needed to f-color G is called the f-chromatic index of G and denoted by $\small{{\chi}`_f}$(G). An [r, s, t; f]-coloring of a graph G is a mapping c from V(G) $\small{\bigcup}$ E(G) to the color set C
Keywords
f-coloring;[r,s,t]-coloring;[r,s,t;f]-coloring;f-total coloring;[r,s,t;f]-chromatic number;
Language
English
Cited by
References
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.

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.

4.
S. L. Hakimi and O. Kariv, A generalization of edge-coloring in graphs, J. Graph Theory 10 (1986), no. 2, 139-154.

5.
F. Havet and M. L. Yu, (p, 1)-total labelling of graphs, Discrete Math. 308 (2008), no. 4, 496-513.

6.
A. Kemnitz and M. Marangio, [r, s, t]-colorings of graphs, Discrete Math. 307 (2007), no. 2, 199-207.

7.
X. Zhang and G. Liu, The classification of complete graphs $K_n$ on f-coloring, J. Appl. Math. Comput. 19 (2005), no. 1-2, 127-133.

8.
X. Zhang and G. Liu, Some sufficient conditions for a graph to be of $C_f$ 1, Appl. Math. Lett. 19 (2006), no. 1, 38-44.

9.
X. Zhang and G. Liu, Some graphs of class 1 for f-colorings, Appl. Math. Lett. 21 (2008), no. 1, 23-29.