Circular coloring

The chromatic number of the flower snark J₅ is 3, but the circular chromatic number is ≤ 5/2.

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).

1. ${\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 \frac{1}{r}$ along this circle.
2. ${\chi }_c(G)$ is the infimum over all rational numbers $\frac{n}{k}$ so that there exists a map from $V(G)$ to the cyclic group $\mathbb{\mathbb{Z}}/n\mathbb{\mathbb{Z}}$ with the property that adjacent vertices map to elements at distance $\ge k$ apart.
3. 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 (Vince 1988), 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

Circular complete graph
Vertices	n
Edges	n(n − 2k + 1) / 2
Girth	$\{\begin{array}{ll}\mathrm{\infty }& n=2k\\ n& n=2k+1\\ 4& 2k+2\le n<3k\\ 3& \text{otherwise}\end{array}$
Chromatic number	⌈n/k⌉
Properties	(n − 2k + 1)-regular Vertex-transitive Circulant Hamiltonian
Notation	$K_{n/k}$
Table of graphs and parameters

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

$i+k,i+k+1,\dots ,i+n-kmodn.$

$K_{n/1}$ is just the complete graph K_n, while $K_{2n+1/n}$ is the cycle graph $C_{2n+1}.$

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_{a/b}$ admits a homomorphism into $K_{c/d}$ if and only if $\frac{a}{b}\le \frac{c}{d}.$ This justifies the notation, since if $\frac{a}{b}=\frac{c}{d}$ then $K_{a/b}$ and $K_{c/d}$ 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_{2/1}\to K_{7/3}\to K_{5/2}\to \cdots \to K_{3/1}\to K_{4/1}\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 J₅ into K_5/2 ≈ C₅, which comes earlier than $K_3$ corresponding to the fact that ${\chi }_c(J_5)\le 2.5<3.$

See also

• Rank coloring

References

• Nadolski, Adam (2004), "Circular coloring of graphs", Graph colorings, Contemp. Math., 352, Providence, RI: Amer. Math. Soc., pp. 123–137, doi:10.1090/conm/352/09 .
• Vince, A. (1988), "Star chromatic number", Journal of Graph Theory 12 (4): 551–559, doi:10.1002/jgt.3190120411 .
• Zhu, X. (2001), "Circular chromatic number, a survey", Discrete Mathematics 229 (1–3): 371–410, doi:10.1016/S0012-365X(00)00217-X .