Circular Coloring

In graph theory, circular coloring is a kind of coloring that may be viewed as a refinement of the usual graph coloring. The ''circular chromatic number'' of a graph $G$, denoted $\chi_c(G)$ can be given by any of the following definitions, all of which are equivalent (for finite graphs).

#$\chi_c(G)$ is the infimum over all real numbers $r$ so that there exists a map from $V(G)$ to a circle of circumference 1 with the property that any two adjacent vertices map to points at distance $\ge \tfrac$ along this circle.
#$\chi_c(G)$ is the infimum over all rational numbers $\tfrac$ so that there exists a map from $V(G)$ to the cyclic group $\Z/n\Z$ with the property that adjacent vertices map to elements at distance $\ge k$ apart.
#In an oriented graph, declare the ''imbalance'' of a cycle $C$ to be $, E(C),$ divided by the minimum of the number of edges directed clockwise and the number of edges directed counterclockwise. Define the ''imbalance'' of the oriented graph to be the maximum imbalance of a cycle. Now, $\chi_c(G)$ is the minimum imbalance of an orientation of $G$.

It is relatively easy to see that $\chi_c(G) \le \chi(G)$ (especially using 1 or 2), but in fact $\lceil \chi_c(G) \rceil = \chi(G)$. It is in this sense that we view circular chromatic number as a refinement of the usual chromatic number.

Circular coloring was originally defined by , who called it "star coloring".

Coloring is dual to the subject of nowhere-zero flows and indeed, circular coloring has a natural dual notion: circular flows.

Circular complete graphs

For integers $n,k$ such that $n\ge 2k$, the circular complete graph $K_$ (also known as a circular clique) is the graph with vertex set $\Z/n\Z=\$ and edges between elements at distance $\ge k.$
That is vertex ''i'' is adjacent to:

:$i+k, i+k+1, \ldots, i+n-k \bmod n.$

$K_$ is just the complete graph , while $K_$ is the cycle graph $C_.$

A circular coloring is then, according to the second definition above, a homomorphism into a circular complete graph. The crucial fact about these graphs is that $K_$ admits a homomorphism into $K_$ if and only if $\tfrac \le \tfrac.$ This justifies the notation, since if $\tfrac = \tfrac$ then $K_$ and $K_$ are homomorphically equivalent. Moreover, the homomorphism order among them refines the order given by complete graphs into a dense order, corresponding to rational numbers $\ge 2$. For example

:$K_ \to K_ \to K_ \to \cdots \to K_ \to K_ \to \cdots$

or equivalently

:$K_2 \to C_7 \to C_5 \to \cdots \to K_3 \to K_4 \to \cdots$

The example on the figure can be interpreted as a homomorphism from the flower snark into , which comes earlier than $K_3$ corresponding to the fact that $\chi_c(J_5) \le 2.5 < 3.$

See also

*Rank coloring

References

*.
*.
*.
Graph coloring
Parametric families of graphs
Regular graphs

{{combin-stub