Adjacent Strong Edge Coloring 邻强边染色
vertex strong total coloring 点强全染色 ; 点强全着色
strong edge coloring 强边染色
strong edge-coloring 强边着色
list strong edge coloring 列表强边染色
adjacent strong total 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 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.
其次，引入强边着色、关联着色的定义。
应用推荐