Document Type
Lecture
Publication Date
10-12-2016
Abstract
For integers k, r > 0, a (k, r )-coloring of a graphs G is a proper coloring on the vertices of G with k colors such that every vertex v of degree d(v) is adjacent to vertices with at leastmin{d(v), r} different colors. The r-hued chromatic number, denoted by xr(G, is the smallest integer k for which a graph G has a (k, r)-coloring. We focus on the upper bound of xr(G)?x(G), where G is a Prfree graph. This is a joint work with Hong-Jian Lai and Murong Xu from West Virginia University.
Relational Format
presentation
Recommended Citation
Lv, Xuezheng, "r-hued chromatic number of P_t-free graphs" (2016). Combinatorics Seminar. 24.
https://egrove.olemiss.edu/math_combinatorics/24
COinS
