r)-coloring of G is a proper coloring with k colors such that for every vertex v with degree d(v) in G
the color number of the neighbors of v is at least min{d(v)
r}. The smallest integer k such that G has an(k
r)-coloring is called the r-hued chromatic number and denoted by χr(G). In this paper
we study the r-hued coloring of direct product of path with the square of path
and obtain its r-hued chromatic number.
关键词
Keywords
references
CHEN Y, FAN S H, LAI H J, et al. On dynamic coloring for planar graphs and graphs of higher genus[J]. Discrete Applied Mathematics, 2012, 160(7/8):1064-1071.
LAI H J, LIN J L, MONTGOMERY B, et al. Conditional colorings of graphs[J]. Discrete Math, 2006, 306(16):1997-2004.
DEEPA T, VENKATACHALAM M, FALCONR M, et al. On the r-dynamic coloring of the direct product of a path with either a path or a cycle[J]. AIMS Math, 2020, 5(6):6496-6520.
MONTGOMERY B. Dynamic coloring of graphs[D]. Morgantwon:West Virginia University, 2001.
LAI H J, MONTGOMERY B, POON H. Upper bounds of dynamic chromatic number[J]. Ars Combinatoria:An AustralianCanadian Journal of Combinatorics, 2003, 68:193-201.
AKBARI S, GHANBARI M, JAHANBEKAM S. On the list dynamic coloring of graphs[J]. Discrete Applied Mathematics, 2009,157(14):3005-3007.