Exact coloring
In graph theory, an exact coloring is a (proper) vertex coloring in which every pair of colors appears on exactly one pair of adjacent vertices. That is, it is a partition of the vertices of the graph into disjoint independent sets such that, for each pair of distinct independent sets in the partition, there is exactly one edge with endpoints in each set.[1][2]
Complete graphs, detachments, and Euler tours
Every n-vertex complete graph Kn has an exact coloring with n colors, obtained by giving each vertex a distinct color. Every graph with an n-color exact coloring may be obtained as a detachment of a complete graph, a graph obtained from the complete graph by splitting each vertex into an independent set and reconnecting each edge incident to the vertex to exactly one of the members of the corresponding independent set.[1][2]
When k is an odd number, A path or cycle with [math]\displaystyle{ \tbinom{k}{2} }[/math] edges has an exact coloring, obtained by forming an exact coloring of the complete graph Kk and then finding an Euler tour of this complete graph. For instance, a path with three edges has a complete 3-coloring.[2]
Related types of coloring
Exact colorings are closely related to harmonious colorings (colorings in which each pair of colors appears at most once) and complete colorings (colorings in which each pair of colors appears at least once). Clearly, an exact coloring is a coloring that is both harmonious and complete. A graph G with n vertices and m edges has a harmonious k-coloring if and only if [math]\displaystyle{ m\le\tbinom{k}{2} }[/math] and the graph formed from G by adding [math]\displaystyle{ \tbinom{k}{2}-m }[/math] isolated edges has an exact coloring. A graph G with the same parameters has a complete k-coloring if and only if [math]\displaystyle{ m\ge\tbinom{k}{2} }[/math] and there exists a subgraph H of G with an exact k-coloring in which each edge of G − H has endpoints of different colorings. The need for the condition on the edges of G − H is shown by the example of a four-vertex cycle, which has a subgraph with an exact 3-coloring (the three-edge path) but does not have a complete 3-coloring itself.[2]
Computational complexity
It is NP-complete to determine whether a given graph has an exact coloring, even in the case that the graph is a tree.[1][3] However, the problem may be solved in polynomial time for trees of bounded degree.[1][4]
References
- ↑ 1.0 1.1 1.2 1.3 Edwards, Keith (2005), "Detachments of complete graphs", Combinatorics, Probability and Computing 14 (3): 275–310, doi:10.1017/S0963548304006558.
- ↑ 2.0 2.1 2.2 2.3 Edwards, Keith (2010), "Achromatic number of fragmentable graphs", Journal of Graph Theory 65 (2): 94–114, doi:10.1002/jgt.20468.
- ↑ Edwards, Keith; McDiarmid, Colin (1995), "The complexity of harmonious colouring for trees", Discrete Applied Mathematics 57 (2–3): 133–144, doi:10.1016/0166-218X(94)00100-R.
- ↑ Edwards, Keith (1996), "The harmonious chromatic number of bounded degree trees", Combinatorics, Probability and Computing 5 (1): 15–28, doi:10.1017/S0963548300001802.
 |  |
