The basal theorem of DNA algorithm for edge-coloring is given and proved, and DNA algorithm on closed circle DNA was designed and realized.
提出并证明了边着色问题的基本定理，设计并实现了闭环dna计算算法。
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.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
A mathematical model of the competitive procedure arrangement is designed in this article by using the edge coloring method of graph theory.
利用图论的边着色理论建立了一个赛程安排的数学模型。
Secondly, the article introduce the concept of strong edge coloring and incidence coloring.
其次，引入强边着色、关联着色的定义。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
The strong edge coloring of graphs comes from computer science and has a very strong practical background, but it is very difficult to determine its strong chromatic number for any graphs.
图的强染色来自计算机科学，有着很强的实际背景，但确定图的强色数是非常困难的。
The course covers both cutting and coloring aspects. It is a perfect choice for salon owners, art directors and senior stylists to to sharpen their creative edge.
创意课程同时覆盖剪发和染发内容，是发廊经营者、艺术总监和真正不断寻求进步并尝试突破创意屏障的发型师的首要选择。
The main difference between them is coloring requirements:every D-edge at least has two vertices colored differently, while every C-edge at least has two vertices of the same color.
它们的主要区别在于染色要求上：每一D-超边至少有两点异色，每一C-超边至少有两点同色。
The main difference between them is coloring requirements:every D-edge at least has two vertices colored differently, while every C-edge at least has two vertices of the same color.
它们的主要区别在于染色要求上：每一D-超边至少有两点异色，每一C-超边至少有两点同色。
应用推荐