... 邻强边染色 Adjacent Strong Edge Coloring 邻强边色数 adjacent strong edge chromatic number 邻边比对边 cot ; cotAb/a ...
基于10个网页-相关网页
The adjacent strong edge coloring can be looked as D（1）- vertex-distinguishing edge-coloring while the vertex-distinguishing edge-coloring can be looked as D（β）- vertex-distinguishing edge-coloring whenβis the diameter of the graph.
邻强边染色可以看作是图的距离为1的点可区别的边染色,而点可区别的边染色可以看作是图的距离不大于其直径的任意两点可区别的边染色。
参考来源 - 图的点可区别的边染色及点可区别的全染色·2,447,543篇论文数据，部分数据来源于NoteExpress
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.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
应用推荐