THE STRONG CHROMATIC INDEX OF A CUBIC GRAPH IS AT MOST 10
THE STRONG CHROMATIC INDEX OF A CUBIC GRAPH IS AT MOST 10
复制标题
DOI：
10.1016/0012-365x(92)90678-9
复制
发表时间：
1992-10-28
影响因子：
0.8
通讯作者：
ANDERSEN, LD
中科院分区：
文献类型：
--
作者：
ANDERSEN, LD
证明了最大度不超过3的图有不超过10色的强边染色。一个简单的算法，实现了强边着色与最多10种颜色的任何图的最大程度在最多3描述，该算法是一个贪婪的性质，并具有运行时间的线性图的顶点数。
It is proved that a graph with maximum degree at most 3 has a strong edge-colouring with at most 10 colours. A simple algorithm achieving a strong edge-colouring with at most 10 colours for any graph with maximum degree at most 3 is described; the algorithm is of a greedy nature and has running time linear in the number of vertices of the graph.