查询词典 chromatic number

In this paper,we proved that the total chromatic number and adjacent strong edge chromatic number of Cartesian product graph of cycle Cm and cycle C5n.

如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。

To resolve the algorithm of the chromatic number of a graph,a special method is adopt to remember the coloring process of graph,and the method does different jobs for four given cases during the coloring process.The adjacent strong edge chromatic number of join graph of star and path is obtained.

为了解决图的邻强边染色问题中一个图的色数算法问题，通过特别的方法来记图的染色过程，同时分4种情况讨论了星和路联图的邻强边染色问题，指出在染色过程中给定的4种情况的染色方法各不相同，并通过对图的着色得到了星和路联图的邻强边色数。

In this dissertation, we shall study the incidence coloring ofθ- graph, then we shall define the concepts of the adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence chromatic number of graphs and determine the adjacent vertex distinguishing incidence chromatic number of some graphs.

本文研究了θ-图的关联着色，定义了图的邻点可区别关联着色及邻点可区别关联色数并确定了几类图的邻点可区别关联色数。

In this master thesis, we mainly discuss the adjacent vertex- distinguishing total chromatic numbers of some special graphs and prove that Zhang"s conjecture holds for these graphs. Then we get the adjacent vertex-distinguishing total chromatic numbers of the Halin Graphs. Moreover, we investigate the Generalized Petersen Graphs, prove that some classes of positive integers can"t structure the Generalized Petersen Graphs and get the result that the adjacent vertex-distinguishing total chromatic number is 5. Finally, based on the number and the parity of circles contained by the graph, we get the adjacent vertex-distinguishing total chromatic number of two classes of graphs.

本学位论文首先主要针对几个特殊图类讨论其邻点可区别全色数，验证了其满足图的邻点可区别全色数的猜想；再证明了非轮的Halin图的邻点可区别全色数；接着研究的是广义Petersen图，讨论了不能构成广义Petersen图的几类正整数，并证明了该图的邻点可区别全色数等于5；最后，根据图所含圈的个数及其奇偶性得到了两类图的邻点可区别全色数。

In this paper, we get the fractional chromatic number about several kinds of graphs. And according to these results we get the chromatic number on these graphs.

文中给出了一些图类的分数色数，并根据这些结果得到了其中一些图类的顶点色数。

In section three, the conception of the Peterson graph is incited and the fractional chromatic number and the chromatic number of one kind of them are given.

在第三部分中介绍了当k=2时的广义Peterson图的概念，给出了其中一类图的分数色数以及顶点色数。

In this paper, we first study the game chromatic number on graphs, and then we give some examples for the lower bound about the game chromatic number of the planar graphs.

首先全面分析了图的点对策着色问题，对某些定理的下界，给出了具体的例子。

In Chapter 4, we calculate the equitable total chromatic number of some specific graphs. For some plane graph, we also calculate the vertex-edge-face equitable total chromatic number.

在第四章中主要计算了一些特殊图的均匀全色数，对于一些平面图计算出了它的均匀全色数。

At last, we learn the property of the problem on the relaxed game chromatic on graphs. Then we introduce the concept of edge relaxed game chromatic number, and we give the upbound of edge relaxed game chromatic number of chain and cycle.

最后对于松弛对策着色问题进行了初步的探讨，提出了边松弛对策着色问题，给出了边松弛对策色数的概念，并给出了链、圈的边松弛对策色数的上界。

Then we investigate a variation of the edge game chromatic number of a graph called edge game chromatic numberⅡ, and also we give the upbound of edge game chromatic number II of some simple graphs.

我们还提出了第二边对策色数这个概念，在此基础上给出了几类简单图的第二边对策色数的上界。

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。