The concept of square-free coloring was introduced in graph theory by Alon in 2002.
无正方形着色的概念由阿龙在2002年引入图论。
So far, for any graph, the Total Coloring Conjecture is still an open problem.
到目前为止，对于一般的图，全着色猜想仍然是一个公开的问题。
The coloring theory of graphs is one important branch of graph theory.
图的染色理论是图论中的一个重要分支。
Taking an issue in graph coloring as a teaching subject, the paper puts forward a feasible concept in the design of HVE mathematical modeling teaching.
该文通过一个图形着色问题作为教学主题，提出一种比较容易实现的高职数学建模的教学设计理念。
An investigation of hyper-heuristic approach upon a set of widely used constructive heuristics(graph coloring heuristics) in timetabling is presented.
在此基础上提出了一种基于多个图染色启发式规则的模拟退火超启发式算法。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。
A proper edge coloring of a graph is called an adjacent strong edge coloring if no two of its adjacent vertices are incident with edges colored by the same set of colors.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
Secondly, we investigate the list coloring of planar graphs, and give a su? Cientcondition for a planar graph being 3-choosable.
其次，文章研究了平面图的列表着色问题，给出了平面图3 -可选的一个充分条件。
The watermarking binary is embedded by using the principle of register allocation, constructing the graph coloring model and function and changing the nodes colors in the interfere graph.
利用寄存器分配原理，构造图着色模型和函数，通过修改图结点颜色实现二进制水印信息位的嵌入。
We observe the heavy-tailed distribution of cycles in solving some graph coloring instances.
已发现一类着色问题的求解，显现出重尾分布的现象。
By the research of dynamic spectrum allocation algorithm based on graph coloring theory, this paper proposes an improved maximum utility spectrum allocation algorithm.
研究基于图着色理论的频谱分配算法，提出一种改进的最大效用频谱分配算法。
The coloring problem is always important problem in graph theory. In the discrete mathematics and combinatorial analysis, the coloring problem has a wide range of applications.
图的着色问题一直是图论中的重要问题，并且在离散数学和组合分析中有着重要的应用。
In order to reduce the outage probability and enhance the stability of cognitive system, an improved algorithm of spectrum allocation based on classical graph coloring model was proposed.
为了降低认知系统的通信中断概率，提高认知系统的稳定性，在经典的图论着色模型基础上提出了一种改进的频谱分配算法。
This paper firstly introduce the cognitive radio system based on the spectrum allocation of graph coloring model and mathematical symbols descriptions;
该文首先对认知无线电系统中基于图论着色的频谱分配模型及其数学符号描述进行介绍；
Then the algorithms of graph coloring are studied and compared;
然后对图论着色中的几种算法进行了详细研究并比较总结；
Graph coloring is an important branch of graph theory.
图的染色理论是图论的一个重要分支。
As the concept of square-free coloring was introduced in graph theory by Alon in 2002.
强边着色理论做为一般图的边着色的推广被自然的引入。
As described before, utility graph coloring with proportional fair utility is implemented by the satellite in the spectrum allocation.
如前所述，在频谱分配中卫星执行实用工具图。
A mathematical model of the competitive procedure arrangement is designed in this article by using the edge coloring method of graph theory.
利用图论的边着色理论建立了一个赛程安排的数学模型。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
Graph Coloring problem (GCP) is an NP hard problem.
图着色问题(GCP)是NP完全问题。
The transmission scheduling of wireless mesh networks(WMNs) is modeled as a problem of conflict graph coloring.
无线网状网络是一种受到广泛关注的宽带无线网络架构。
The transmission scheduling of wireless mesh networks(WMNs) is modeled as a problem of conflict graph coloring.
无线网状网络是一种受到广泛关注的宽带无线网络架构。
应用推荐