The adjacent vertex-distinguishing incidence coloring is incidence coloring satisfiying the sets of the colors of two adjacentvertices are different.
邻点可区别关联着色是使得相邻顶点的颜色集不同的关联着色。
2
A proper edge coloring of a graph is called an adjacent strong edge coloring if no two of its adjacentvertices are incident with edges colored by the same set of colors.
如果在一个图的正常边着色中，相邻两点关联的边集所着的颜色集合不同，则称此正常边着色为相邻强边着色。
3
Given an undirected graph with weights on the vertices, the maximum weight clique problem is to find a subset of mutually adjacentvertices (i. e., a clique) having the largest total weight.