Adjacent strong edge chromatic number.
4．相邻强边着色数。
参考来源 - 图的广义着色·2,447,543篇论文数据，部分数据来源于NoteExpress
Adjacent strong edge chromatic number.
相邻强边着色数。
The algorithm for the adjacent strong edge coloring of graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
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.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
应用推荐