The fractional incidence chromatic number is defined.
定义了图的分数关联色数。
Chromatic number and fractional chromatic number are two important parameters of a graph.
分式色数和点色数是图的两个重要参数。
The adjacent vertex distinguishing total chromatic number is obtained for the flower graph.
得到了花图的邻点可区别全色数。
In this paper a estimate of the harmonious chromatic number of a complete 5-ary tree was given.
本文给出了五元完全树的调和着色数的比较好的估计。
The edge chromatic number of join graph with fan and complete balanced bipartite graph was obtained.
得到了扇和完全等二部图联图的边色数。
In this paper, we obtain the game chromatic number and relaxed game chromatic number of wheel and fan.
讨论了图的二人对策着色和放松对策着色，给出了轮图与扇图的对策色数与放松对策色数。
The upper bound of conditional chromatic number of graphs and the graphs satisfying this bound are obtained.
得到了图的条件色数的上界和达到上界的图类。
The adjacent vertex distinguishing total chromatic number is obtained for the middle graphs of path, cycle, star and fan graph.
本文考虑了图的中间图的邻点可区别全色数，并确定了路、圈、星图和扇图的中间图的邻点可区别全色数。
The circular chromatic number and the fractional chromatic number are two generalizations of the ordinary chromatic number of a graph.
圆色数和分式色数是图的点色数的两个推广。
With this characterization, the bandwidth, topological bandwidth and the path chromatic number for unit interval graphs are determined.
并由该刻划确定出单位区间图的带宽、拓扑带宽和路色数。
In this paper, Euler's formula and Handshaking lemma is used to obtain the face chromatic number of a planar graph by solving equations.
本文在前人研究的面着色问题基础上，运用欧拉公式和握手定理通过解方程组得到连通平面图的面色数。
In the sixth part, the probability estimates of vertex-adjacent vertex distinguishing total chromatic number of some graphs are discussed.
第六部分讨论图的点邻点可区别全色数的概率方法估计。
Besides, it concretely analysized the calculation of face chromatic number of plan view on the surface of the sphere and the ring, and promoted the application of equations.
具体分析了球面和环面上平面图面色数的计算，并将方程组的应用进行推广。
The strong edge coloring of graphs comes from computer science and has a very strong practical background, but it is very difficult to determine its strong chromatic number for any graphs.
图的强染色来自计算机科学，有着很强的实际背景，但确定图的强色数是非常困难的。
We also investigate chromatic polymial of graph by its cyclomatie number, and verify unimodality of chromatic polymial of some graph.
我们又用基回数考察了图的色多项式，验证了某些图类的色多项式的单峰性。
To decrease number of samples for the implementation of color space transformation, a method for modeling the chromatic characterization of video cameras was proposed.
建立摄像机的色度模型，减少用于色空间转换所需要的样本数。
To decrease number of samples for the implementation of color space transformation, a method for modeling the chromatic characterization of video cameras was proposed.
建立摄像机的色度模型，减少用于色空间转换所需要的样本数。
应用推荐