中文摘要：

图G的一个（k）b-染色是一个正常k染色,且满足在每一个色类中至少存在一个顶点,使得该顶点与其他每个色类中至少一个顶点是邻接的.图G的b-染色数用b（G）来表示,b（G）为最大的正整数k,且用k种颜色能够对G进行b-染色.对于任意的k：χ（G）≤k≤b（G）,若用k种颜色能对图G进行b-染色,称图G是b-连续.通过设计具体b-染色方案,研究了Corona图CnｏPm、CnｏK1,m以及CnｏWm＋1的m-度与b-染色数,且证明这些图都是b-连续的.

英文摘要：

A （k）b-coloring of a graph G is such a （k） proper coloring that there exists at least a vertex in every color classes which has at least a neighboring vertex in every other color classes. The b-chromatic number of graph G, denoted by b（G）, is the largest integer k that the b-coloring of the graph G can be per- formed with k different colors. A graph G will be called as of b-continuity if and only if k .k：χ（G）≤k≤b（G） for arbitrary k to perform b-coloring of graph G with k colors. By means of designing a concrete b-coloring plan, the b-chromatic number and m-degree of Corona graphs CnoPm、CnoK1,m以 and CnoWm＋1 are studied and it is proved that all of these graphs are b-continuity.