In this paper, four types of graph coloring are discussed: dynamic coloring, incidence coloring, entire coloring and edge - face coloringof planar graphs.
本文讨论了若干图类的四种不同的着色问题:动态着色、关联着色、平面图的完备着色和边面着色。
2
The algorithm for the adjacent strong edgecoloringof graphs is an NP-complete problem.
图的邻强边着色算法是一个NP完全问题。
3
A proper edgecoloringof a graph is called an adjacent strong edgecoloring if no two of its adjacent vertices are incident with edges colored by the same set of colors.