您要查找的是不是：
- vertex chromatic number 点色数
- Vince is a natural generalization of chromatic number. Vince定义的星着色数推广了一般的着色数的定义 .
- We shall present some of the basic properties of the vertex and edge chromatic numbers. 我们将介绍顶点色数和边色数的一些基本性质。
- vertex strong total chromatic number 点强全色数
- It is not easy to see that there are triangle-free graphs of large chromatic number. 很不容易看出这里是否存在色数很大而没有三角形的图。
- The concept of the relaxed game chromatic number of graphs was introduced by Chou, Wang and Zhu in [21]. 一个图的松弛竞赛色数是由周，王，朱在[21]中提出的，并且它在图论中是极其有意义的。
- the adjacent vertex distinguishing total chromatic number 邻点可区别全色数
- The adjacent vertex-distinguishing total chromatic number of Subdivision of Fn,Wn,Km,n was got in this paper. 对扇,轮,完全二部图作了简单的剖分,得到了它们的剖分图,并得到了其剖分图的邻点可区别全色数
- This paper discusses the upper chromatic number of the Cartesian product of co-hypergraphs. 讨论反超图的笛卡儿积的着色理论,求出了满足一定条件的反超图的笛卡儿积的上色数。
- The coloring problems are often discussed in many papers. Many papers are concerned with finding algorithms to reduce the chromatic number of graphs. 著色问题在许多论文中常被探讨，而这些论文最主要是找到好的演算法，来降低图形的最小著色数。
- The total chromatic number of a kind of graph have been got in this article.is a star and is a complete equal 2-partite graph. 作者单位：兰州交通大学;兰州交通大学86信箱甘肃兰州;西北第二民族学院信息与计算科学系宁夏银川;86信箱甘肃兰州
- The circular chromatic number of a graph is a natural generalization of the chromatic number of a graph introduced by Vince in 1988 under the name " the star chromatic number " . 一个图G的圆色数x_c(G)是图G的色数x(G)的自然推广,最初是由Vince于1988年以“星色数”的定义提出来的。
- The game chromatic number of a graph was introduced by Bodlaender[1] Recently, Chou, Wang and Zhu put forward a new concept-the relaxed game chromatic number of graph in [2]. 一个图的竞赛色数是由Bodlaender[1]首次提出的。 最近，周，王，朱在文献[2]中提出了松弛竞赛色数的概念，此概念在图论中占有很重要的地位。
- The problem about the minimum number of edges is discussed and an upper bound of the minimum number of edges of 3-unifomi C-hypergraphs with upper chromatic number 2 is given. 摘要讨论了3一致C超图的最小边数问题，给出了上色数为2的3一致C超图的最小边数的一个上界。
- The company now has five multi-color intaglio printing machine and a hot transfer printed cloth production lines, printing chromatic number to seven-color maximum. 公司目前拥有五台多色凹版印刷机和一条热转移印布生产线，印刷色数最大可至七色。
- The collection of relevant materials helps to get some relevant knowledge.The theoretical knowledge of Chromatic number is put into practice on the foundation of this method. 有关资料的收集，帮助获得了一些相关的知识.;在此方法的基础上将色数的有关理论知识应用到实际生活中去
- The Total Chromatic Number of Halin Graph with an Unique Major Vertex 具有唯一最大度点的Halin图的全色数
- In this paper we characterize completely the entire chromatic numbers of all outerplane graphs with maximum degree 4. 完全刻划了所有最大度为4的外平面图的完备色数。
- A dynamic coloring of a graph is a new concept which is introduced by Bruce Montgomery in 2001.This paper proves that the dynamic chromatic number of Halin graphs and Series-Parallel which is not 5-cycle is not more than four. 图的动态着色是BruceMontgomery于2001年引入的一个新概念。 本文分别证明了Halin图和非5圈的Series Parallel图的动态色数都不超过4。
- The star chromatic number x*(G) of a graph G(sometimes it is also called circular chromatic number Xc(G)) is a natural generation of the chromatic number x(G) of a graph. It was first defined by Vince in [1]. 图G的星色数x~*(G)(亦称圈色数);是G的色数x(G)的一个自然推广;它最早由Vince在文献[1]中提出.
