着色数

图的全谐调着色数

On the Total Harmonious Chromatic Number of a Graph

五元完全树的调和着色数

The harmonious chromatic number of a complete 5 - ary tree

考虑了几类乘积图的均匀着色数，证明了这几类乘积图可均匀k-着色（k≥2或3）。

This paper studied equitable chromatic numbers of several product graphs and proved the graphs are equitably k-colorable where k ≥ 2 or 3 .

本文引入了颜色扩展和颜色调整的方法，对图G进行了关于两个相邻顶点的距离分划，并分层分情形讨论，最后得到了条件着色数的上界和达到上界的图类。

Using extension and adjustment of graphs we give a distance partition of G , obtain the upper bound of conditional coloring number of G and the graphs satisfying this bound .

贪心消着色数与Grundy数

Greedy Colouring and Grundy Number

平面图正常4-着色数的一个计算公式

A Formula for Calculating the Number of All Proper 4-Colorings of Planar Graphs

相邻强边着色数。

Adjacent strong edge chromatic number .

平面图的着色数

Colouring numbers of the plane graph

本文给出了五元完全树的调和着色数的比较好的估计。

In this paper a estimate of the harmonious chromatic number of a complete 5-ary tree was given .

本文应用极端性原则，证明同胚于球面的多面体，其着色数不多于四种。

In this paper , It is proved that the title number of homeomorphic polyhedron 's coloring in spherical surface is not more than four by extreme priciple .

结果显示：（1）6～18岁人群着色氟斑牙数及患病率随着年龄和恒牙萌出时间的增加而增加。

The results show that : ( 1 ) The number of stained dental fluorosis and prevalence rates increase with the rising of age and the lasting of permanent teeth eruption .

极小n棱连通图的着色与棱数

The Coloring and Edge Number of Minimal n-Edge Connected Graph

路的Mycielski图上的对策着色和对策着色数

Game Coloring and Chromatic Number of Mycielski 's Graphs

图的分数着色和分数色数

The fractional coloring and fractional chromatic numbers of graphs

首先定义了顶点2-着色，2-色数及其它有关概念，给出了2-色数的上界。

Vertex 2-coloring , 2 - chromatic number and other related concepts are firstly defined , and the upper bound for 2-chromatic number is given ;