The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
Secondly, the article introduce the concept of strong edge coloring and incidence coloring.
其次，引入强边着色、关联着色的定义。
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.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
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 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.
图的强染色来自计算机科学，有着很强的实际背景，但确定图的强色数是非常困难的。
应用推荐