色数

One of graph edge coloring and graph total coloring problem, as well as whole graph chromatic number problem can be converted to graph vertex coloring to deal with problem.

其中图的边着色和图的全着色问题以及图的色数问题都可以转化为图的顶点着色问题进行处理。

For onenessly,this paper calls it cicular chromatic number.

为统一起见，本文统一称为圈色数。

Analysis of the characteristics of road and circle, reasoning by the circle strong vertex-distinguishing total coloring of the chromatic number, this paper designed an algorithm at.

3分析了路和圈的特点，推理得到了圈的点可区别强全染色的色数，本文设计了一个算法，并在。net环境下验证得到12个点以内的5染色结果，这用手工染色在短时间内是无法完成的。

Part two, three and four have made conclusions and evolutions about the circular chromatic number of planar graphs, Mycielski graphs and distance graphs.

第二、三、四部分分别总结了关于平面图、Mycielski图和距离图的圈色数的一些结论和这些问题的进展情况。

The total chromatic number, denoted by X, is defined as the minimum number k for which G is k-total colorable.

本文证明了对最大度为6的双外平面图，全色数是+1，其中△为G的最大度数。

Ifσ: I→C is an incidence coloring of G and |C|=k, k is a positive integer, then we say that G is k- incidence colorable andσis a k - incidence coloring of G; The minimum value of k such that G is k -incidence colorable is called the incidence chromatic number of G, and is denoted byχ_i, namelyχ_i = min {|C||σ: I→C is an incidence coloring of G}.

若σ：I(G→C是G的一个关联着色且|C|=k，k是一个正整数，则称G是k-可关联着色的，σ是G的一个k-关联着色；使得G是k-可关联着色的最小的k值称为G的关联色数，记为X_i，即X_i=min{|C||σ：I→C是G的关联着色}。

In section two,we will prove thatχ_s=εΔ,where T is a tree andε(∈[1,2]) is a real number,by using the result of tree,we bound the star chromatic index of Halin graphs and monocycle graphs.

第二节研究了树的星边染色，证明了对最大度为Δ的树T，存在实数ε(1≤ε≤2)使得χ_s=εΔ，最后利用树的结果给出了Halin图和单圈图星边色数的上界。

In section four,we will study the star-edge coloring of maximal outer plane graph and maximal plane graph,and bound their star chromatic index.

第四节研究了极大外平面图和极大平面图的星边染色，并界定了它们的星边色数。

The theory of graphs and relations between the spectra and fixed variate (e.g. chromatic number, degree sequence, diameter and connectivity) of graphs by means of the well-developed theory and technique of algebra, topological structure properties of graph, combination and matrix theories so as to establish firm essential relation between the algebraic properties and topological properties of graphs and networks.

图谱理论的研究主要是利用成熟的代数理论和技巧，并结合图的拓扑结构性质和组合数学的理论、矩阵理论来研究图谱及其与图的结构性质、图的其它不变量(如色数，度序列，直径，连通度等)之间的关系，将图与网络的代数性质与图的拓扑性质紧密地联系在—起。

In this paper, we discuss the first weak total chromatic number of the double graph of path, circle, star, fan, wheel and complete.

给出了路、圈、星、扇、轮、完全图的倍图的第一类弱全色数。

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万美元，产品价廉物美、选料上乘、质量保证，深受国内外客户的青睐