图7：由系统组件所着色的项目团队成员的工件分配。

Figure 7: Project team member assignment of artifacts colored by system component.

youdao

到目前为止，对于一般的图，全着色猜想仍然是一个公开的问题。

So far, for any graph, the Total Coloring Conjecture is still an open problem.

youdao

图着色问题是著名的NP-完全问题。

Minimum Steiner tree problem is NP complete problem.

youdao

图着色问题是著名的NP-完全问题。

Minimum Steiner tree problem is NP complete problem.

youdao