查询词典 coloring

In this paper three different types of colorings are studied, which are incidence coloring of graphs, acyclic edge coloring and strong edge coloring.

本文研究了三种不同的着色：图的关联着色、无圈边着色和强边着色。

The company has a number of plastic products specializing in coloring, modified and functional additive technology developed by staff, with a solid technical foundation and rich experience, has overcome Rubber coloring, additives and many other aspects of problems, development and developed many new products .

公司拥有一批专门从事塑料制品着色、改性和功能助剂开发的技术人员，具有雄厚的技术基础和丰富经验，先后攻克橡塑着色，助剂等许多方面难题，开发和研制了许多新型产品。

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种情况的染色方法各不相同，并通过对图的着色得到了星和路联图的邻强边色数。

The concepts of adjacent vertex distinguishing incidence coloring and the adjacent vertex distinguishing incidence coloring number of graphs are defined on the basis of the concept of incidence coloring of graphs.

在图的关联着色概念的基础上定义了图的邻点可区别关联着色及邻点可区别关联色数，研究了圈、完全二部图、Cm。

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.

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

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的关联着色}。

Graph Coloring Problem is one of the typical NP-hard problems in combinatorial optimization problem.

图着色问题（GCP，Graph Coloring Problem）是经典的NP-Hard组合优化问题之一。

In the third section of this paper, on the comprehensive study of some properties of proper k-vertex-coloring、 k-edge-coloring、 and total-coloring of a graph, the standard genetic algorithm for graph coloring is researched.

在本文的第三章节中，在系统分析了图的正常k－顶点着色、k－边着色和全着色问题的基础上，对基于遗传算法的图的着色问题的求解过程进行了深入的理论分析。

As the general interval coloring problem is NP-complete, a property of the program, namely the containment of arrays\' live-ranges, is used to decrease the hardness of interval coloring and simplify it as an interval coloring problem for superperfect graph. Based on this, a judgment theorem for optimal interval coloring together with the implementation algorithm is proposed.

由于一般的区间着色问题是NP完全问题，我们利用程序所具有的一个性质，即数组生命周期的包含性来降低区间着色的难度，将一般的区间着色问题简化为超完美图的区间着色问题，并据此提出了实现最优区间着色的判定条件以及实现算法。

In 2006,LIU Xin-sheng et al.introduced the concept of star-edge coloring of graphs, a star-edge coloring of graph G is a proper edge coloring of G such that any path of length 4 in G is not bicolored.The star chromatic index of G,denoted byχ_s,is the smallest integer k for which G admits a star-edge coloring with k colors.

2006年，刘信生等提出了星边染色的概念，若图G的一个正常边染色满足G中没有长为4的路是2-边染色的，则称此染色是G的一个星边染色，使得G有星边染色的最小颜色数称为星边色数，记作χ_s。

However, as the name（read－only memory）implies, CD disks cannot be written onorchanged in any way.

然而，正如其名字所指出的那样，CD盘不能写，也不能用任何方式改变其内容。

Galvanizes steel pallet is mainly export which suits standard packing of European Union, the North America. galvanizes steel pallet is suitable to heavy rack. Pallet surface can design plate type, corrugated and the gap form, satisfies the different requirements.

镀锌钢托盘多用于出口，替代木托盘，免薰蒸，符合欧盟、北美各国对出口货物包装材料的法令要求；喷涂钢托盘适用于重载上货架之用，托盘表面根据需要制作成平板状、波纹状及间隔形式，满足不同的使用要求。