提出并证明了边着色问题的基本定理，设计并实现了闭环dna计算算法。
The basal theorem of DNA algorithm for edge-coloring is given and proved, and DNA algorithm on closed circle DNA was designed and realized.
给出了文件传输问题的边着色模型。
同时给出了文件传输问题的边着色模型。
A edge coloring model for File Transmission Problems is given.
图式流形的同胚分类可转化为图的一类2 -边着色计数问题。
The homeomorphism classification of graph like manifolds can be transformed into a 2 edge colouring enumeration problem for graphs.
图的邻强边着色算法是一个NP完全问题。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。
In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloring of planar graphs.
应用推荐