Graph Coloring problem (GCP) is an NP hard problem.
图着色问题(GCP)是NP完全问题。
The graph coloring problem is a well-known NP-complete problem.
图着色问题是著名的NP-完全问题。
So far, for any graph, the Total Coloring Conjecture is still an open problem.
到目前为止，对于一般的图，全着色猜想仍然是一个公开的问题。
The coloring problem is always important problem in graph theory. In the discrete mathematics and combinatorial analysis, the coloring problem has a wide range of applications.
图的着色问题一直是图论中的重要问题，并且在离散数学和组合分析中有着重要的应用。
The transmission scheduling of wireless mesh networks(WMNs) is modeled as a problem of conflict graph coloring.
无线网状网络是一种受到广泛关注的宽带无线网络架构。
The transmission scheduling of wireless mesh networks(WMNs) is modeled as a problem of conflict graph coloring.
无线网状网络是一种受到广泛关注的宽带无线网络架构。
应用推荐