色数

The adjacent strong edge chromatic number of join graph of star and path is obtained.

证明了圈Cm与圈C5n的笛卡尔积图的全色数和邻强边色数都为5。

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.

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

Specially,we construct some new kinds of planar graphs with circular chromatic number 3 or 4 based on the results which have been surveyed in part two.

其中第二部分在总结平面图的圈色数已有结论的基础上，还构造了一些新的圈色数为3或4的平面图。

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.

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

Because the machine is the chromatic number of limit row six-color business card printing and membership card production, mainly in the spot color on the top and bottom two 100% bars bars has built the small print on, in the middle of a two-color bar is 40 per cent of on the net.

因为机器色数的限制，只能排六色制卡和会员卡制作，难度主要在专色版上，上下两条百分之百色条，色条上有镂空小字，在两色条中间是40％的浅网。

The main work of this paper is that we have given the edge game chromatic number of cycle likes, fan graphs, flowers, Halin graphs, and the upbound is sharp for cycle likes and Halin graphs, it is also a good example for the study of planar and outerplanar graphs.

主要的工作是对一些特殊图类的边对策色数进行了研究，给出了类圈图，扇图，花形图和Halin图的边对策色数的上界，并且证明了关于类圈图和Halin图的结果是紧的，这就给平面图，外平面图的研究提供了很好的例子。

It has been put forward that there exists single Ball point and double Ball points on the symmetrical connecting-rod curves of equilateral mechanisms.

从鲍尔点的形成原理出发，分析对称连杆曲线上鲍尔点的产生条件，提出等边机构的对称连杆曲线上有单鲍尔点和双鲍尔点。

The factory affiliated to the Group primarily manufactures multiple-purpose pincers, baking kits, knives, scissors, kitchenware, gardening tools and beauty care kits as well as other hardware tools, the annual production value of which reaches US$ 30 million dollars.

集团所属工厂主要生产多用钳、烤具、刀具、剪刀、厨具、花园工具、美容套等五金产品，年生产总值3000万美元，产品价廉物美、选料上乘、质量保证，深受国内外客户的青睐