The bounded vertex coloring of a kind of outerplanar graphs
Zhan Xin-gang · Journal of Shandong University · 2004
A k-bounded vertex coloring of a graph G is a usual vertex coloring in which each color is applied to at most k vertices. The bounded chromatic number is the smallest number of colors such that G admits a k-bounded coloring.It is provided some sufficient conditions which can determine the k-bounded chromatic number of a kind of outerplanar graphs in polynomial time.