The first results about graph coloring deal almost exclusively with planar graphs in the form of map coloring. While trying to color a map of the counties of England, Francis Guthrie postulated the four color conjecture, noting that four colors were sufficient to color the map so that no regions sharing a common border received the same color. Guthrie's brother passed on the question to his mathematics teacher Augustus De Morgan at University College, who mentioned it in a letter to William Hamilton in 1852. Arthur Cayley raised the problem at a meeting of the London Mathematical Society in 1879. The same year, Alfred Kempe published a paper that claimed to establish the result, and for a decade the four color problem was considered solved. For his accomplishment Kempe was elected a Fellow of the Royal Society and later President of the London Mathematical Society.^[1]

In 1890, Percy John Heawood pointed out that Kempe's argument was wrong. However, in that paper he proved the five color theorem, saying that every planar map can be colored with no more than five colors, using ideas of Kempe. In the following century, a vast amount of work was done and theories were developed to reduce the number of colors to four, until the four color theorem was finally proved in 1976 by Kenneth Appel and Wolfgang Haken. The proof went back to the ideas of Heawood and Kempe and largely disregarded the intervening developments.^[2] The proof of the four color theorem is noteworthy, aside from its solution of a century-old problem, for being the first major computer-aided proof.

In 1912, George David Birkhoff introduced the chromatic polynomial to study the coloring problem, which was generalised to the Tutte polynomial by Tutte, both of which are important invariants in algebraic graph theory. Kempe had already drawn attention to the general, non-planar case in 1879,^[3] and many results on generalisations of planar graph coloring to surfaces of higher order followed in the early 20th century.

In 1960, Claude Berge formulated another conjecture about graph coloring, the strong perfect graph conjecture, originally motivated by an information-theoretic concept called the zero-error capacity of a graph introduced by Shannon. The conjecture remained unresolved for 40 years, until it was established as the celebrated strong perfect graph theorem by Chudnovsky, Robertson, Seymour, and Thomas in 2002.

Graph coloring has been studied as an algorithmic problem since the early 1970s: the chromatic number problem (see section #Vertex coloring below) is one of Karp's 21 NP-complete problems from 1972, and at approximately the same time various exponential-time algorithms were developed based on backtracking and on the deletion-contraction recurrence of Zykov (1949). One of the major applications of graph coloring, register allocation in compilers, was introduced in 1981.

Vertex coloring edit

When used without any qualification, a coloring of a graph almost always refers to a proper vertex coloring, namely a labeling of the graph's vertices with colors such that no two vertices sharing the same edge have the same color. Since a vertex with a loop (i.e. a connection directly back to itself) could never be properly colored, it is understood that graphs in this context are loopless.

The terminology of using colors for vertex labels goes back to map coloring. Labels like red and blue are only used when the number of colors is small, and normally it is understood that the labels are drawn from the integers {1, 2, 3, …}.

A coloring using at most k colors is called a (proper) k-coloring. The smallest number of colors needed to color a graph G is called its chromatic number, and is often denoted χ(G). Sometimes γ(G) is used, since χ(G) is also used to denote the Euler characteristic of a graph. A graph that can be assigned a (proper) k-coloring is k-colorable, and it is k-chromatic if its chromatic number is exactly k. A subset of vertices assigned to the same color is called a color class, every such class forms an independent set. Thus, a k-coloring is the same as a partition of the vertex set into k independent sets, and the terms k-partite and k-colorable have the same meaning.

Chromatic polynomial edit

The chromatic polynomial counts the number of ways a graph can be colored using some of a given number of colors. For example, using three colors, the graph in the adjacent image can be colored in 12 ways. With only two colors, it cannot be colored at all. With four colors, it can be colored in 24 + 4⋅12 = 72 ways: using all four colors, there are 4! = 24 valid colorings (every assignment of four colors to any 4-vertex graph is a proper coloring); and for every choice of three of the four colors, there are 12 valid 3-colorings. So, for the graph in the example, a table of the number of valid colorings would start like this:

The chromatic polynomial is a function P(G,t) that counts the number of t-colorings of G. As the name indicates, for a given G the function is indeed a polynomial in t. For the example graph, P(G,t) = t(t – 1)²(t – 2), and indeed P(G,4) = 72.

The chromatic polynomial includes more information about the colorability of G than does the chromatic number. Indeed, χ is the smallest positive integer that is not a zero of the chromatic polynomial χ(G) = min{k : P(G,k) > 0}.

Edge coloring edit

An edge coloring of a graph is a proper coloring of the edges, meaning an assignment of colors to edges so that no vertex is incident to two edges of the same color. An edge coloring with k colors is called a k-edge-coloring and is equivalent to the problem of partitioning the edge set into k matchings. The smallest number of colors needed for an edge coloring of a graph G is the chromatic index, or edge chromatic number, χ′(G). A Tait coloring is a 3-edge coloring of a cubic graph. The four color theorem is equivalent to the assertion that every planar cubic bridgeless graph admits a Tait coloring.

Total coloring edit

Total coloring is a type of coloring on the vertices and edges of a graph. When used without any qualification, a total coloring is always assumed to be proper in the sense that no adjacent vertices, no adjacent edges, and no edge and its end-vertices are assigned the same color. The total chromatic number χ″(G) of a graph G is the fewest colors needed in any total coloring of G.

Unlabeled coloring edit

An unlabeled coloring of a graph is an orbit of a coloring under the action of the automorphism group of the graph. The colors remain labeled; it is the graph that is unlabeled. There is an analogue of the chromatic polynomial which counts the number of unlabeled colorings of a graph from a given finite color set.

If we interpret a coloring of a graph on d vertices as a vector in ${\displaystyle \mathbb {Z} ^{d}}$ , the action of an automorphism is a permutation of the coefficients in the coloring vector.

Upper bounds on the chromatic number edit

Assigning distinct colors to distinct vertices always yields a proper coloring, so

${\displaystyle 1\leq \chi (G)\leq n.}$ 

The only graphs that can be 1-colored are edgeless graphs. A complete graph ${\displaystyle K_{n}}$  of n vertices requires ${\displaystyle \chi (K_{n})=n}$  colors. In an optimal coloring there must be at least one of the graph's m edges between every pair of color classes, so

${\displaystyle \chi (G)(\chi (G)-1)\leq 2m.}$ 

More generally a family ${\displaystyle {\mathcal {F}}}$  of graphs is ${\displaystyle \chi }$ -bounded if there is some function ${\displaystyle c}$  such that the graphs ${\displaystyle G}$  in ${\displaystyle {\mathcal {F}}}$  can be colored with at most ${\displaystyle c(\omega (G))}$  colors, for the family of the perfect graphs this function is ${\displaystyle c(\omega (G))=\omega (G)}$ .

The 2-colorable graphs are exactly the bipartite graphs, including trees and forests. By the four color theorem, every planar graph can be 4-colored.

A greedy coloring shows that every graph can be colored with one more color than the maximum vertex degree,

${\displaystyle \chi (G)\leq \Delta (G)+1.}$ 

Complete graphs have ${\displaystyle \chi (G)=n}$  and ${\displaystyle \Delta (G)=n-1}$ , and odd cycles have ${\displaystyle \chi (G)=3}$  and ${\displaystyle \Delta (G)=2}$ , so for these graphs this bound is best possible. In all other cases, the bound can be slightly improved; Brooks' theorem^[4] states that

Brooks' theorem: ${\displaystyle \chi (G)\leq \Delta (G)}$  for a connected, simple graph G, unless G is a complete graph or an odd cycle.

Lower bounds on the chromatic number edit

Several lower bounds for the chromatic bounds have been discovered over the years:

If G contains a clique of size k, then at least k colors are needed to color that clique; in other words, the chromatic number is at least the clique number:

${\displaystyle \chi (G)\geq \omega (G).}$ 

For perfect graphs this bound is tight. Finding cliques is known as the clique problem.

Hoffman's bound: Let ${\displaystyle W}$  be a real symmetric matrix such that ${\displaystyle W_{i,j}=0}$  whenever ${\displaystyle (i,j)}$  is not an edge in ${\displaystyle G}$ . Define ${\displaystyle \chi _{W}(G)=1-{\tfrac {\lambda _{\max }(W)}{\lambda _{\min }(W)}}}$ , where ${\displaystyle \lambda _{\max }(W),\lambda _{\min }(W)}$  are the largest and smallest eigenvalues of ${\displaystyle W}$ . Define ${\textstyle \chi _{H}(G)=\max _{W}\chi _{W}(G)}$ , with ${\displaystyle W}$  as above. Then:

${\displaystyle \chi _{H}(G)\leq \chi (G).}$ 

Vector chromatic number: Let ${\displaystyle W}$  be a positive semi-definite matrix such that ${\displaystyle W_{i,j}\leq -{\tfrac {1}{k-1}}}$  whenever ${\displaystyle (i,j)}$  is an edge in ${\displaystyle G}$ . Define ${\displaystyle \chi _{V}(G)}$  to be the least k for which such a matrix ${\displaystyle W}$  exists. Then

${\displaystyle \chi _{V}(G)\leq \chi (G).}$ 

Lovász number: The Lovász number of a complementary graph is also a lower bound on the chromatic number:

${\displaystyle \vartheta ({\bar {G}})\leq \chi (G).}$ 

Fractional chromatic number: The fractional chromatic number of a graph is a lower bound on the chromatic number as well:

${\displaystyle \chi _{f}(G)\leq \chi (G).}$ 

These bounds are ordered as follows:

${\displaystyle \chi _{H}(G)\leq \chi _{V}(G)\leq \vartheta ({\bar {G}})\leq \chi _{f}(G)\leq \chi (G).}$ 

Graphs with high chromatic number edit

Graphs with large cliques have a high chromatic number, but the opposite is not true. The Grötzsch graph is an example of a 4-chromatic graph without a triangle, and the example can be generalized to the Mycielskians.

Theorem (William T. Tutte 1947,^[5] Alexander Zykov 1949, Jan Mycielski 1955): There exist triangle-free graphs with arbitrarily high chromatic number.

To prove this, both, Mycielski and Zykov, each gave a construction of an inductively defined family of triangle-free graphs but with arbitrarily large chromatic number.^[6] Burling (1965) constructed axis aligned boxes in ${\displaystyle \mathbb {R} ^{3}}$  whose intersection graph is triangle-free and requires arbitrarily many colors to be properly colored. This family of graphs is then called the Burling graphs. The same class of graphs is used for the construction of a family of triangle-free line segments in the plane, given by Pawlik et al. (2014).^[7] It shows that the chromatic number of its intersection graph is arbitrarily large as well. Hence, this implies that axis aligned boxes in ${\displaystyle \mathbb {R} ^{3}}$  as well as line segments in ${\displaystyle \mathbb {R} ^{2}}$  are not χ-bounded.^[7]

From Brooks's theorem, graphs with high chromatic number must have high maximum degree. But colorability is not an entirely local phenomenon: A graph with high girth looks locally like a tree, because all cycles are long, but its chromatic number need not be 2:

Theorem (Erdős): There exist graphs of arbitrarily high girth and chromatic number.^[8]

Bounds on the chromatic index edit

An edge coloring of G is a vertex coloring of its line graph ${\displaystyle L(G)}$ , and vice versa. Thus,

${\displaystyle \chi '(G)=\chi (L(G)).}$ 

There is a strong relationship between edge colorability and the graph's maximum degree ${\displaystyle \Delta (G)}$ . Since all edges incident to the same vertex need their own color, we have

${\displaystyle \chi '(G)\geq \Delta (G).}$ 

Moreover,

Kőnig's theorem: ${\displaystyle \chi '(G)=\Delta (G)}$  if G is bipartite.

In general, the relationship is even stronger than what Brooks's theorem gives for vertex coloring:

Vizing's Theorem: A graph of maximal degree ${\displaystyle \Delta }$  has edge-chromatic number ${\displaystyle \Delta }$  or ${\displaystyle \Delta +1}$ .

Other properties edit

A graph has a k-coloring if and only if it has an acyclic orientation for which the longest path has length at most k; this is the Gallai–Hasse–Roy–Vitaver theorem (Nešetřil & Ossona de Mendez 2012).

For planar graphs, vertex colorings are essentially dual to nowhere-zero flows.

About infinite graphs, much less is known. The following are two of the few results about infinite graph coloring:

• If all finite subgraphs of an infinite graph G are k-colorable, then so is G, under the assumption of the axiom of choice. This is the de Bruijn–Erdős theorem of de Bruijn & Erdős (1951).
• If a graph admits a full n-coloring for every n ≥ n₀, it admits an infinite full coloring (Fawcett 1978).

Open problems edit

As stated above, ${\displaystyle \omega (G)\leq \chi (G)\leq \Delta (G)+1.}$  A conjecture of Reed from 1998 is that the value is essentially closer to the lower bound, ${\displaystyle \chi (G)\leq \left\lceil {\frac {\omega (G)+\Delta (G)+1}{2}}\right\rceil .}$ 

The chromatic number of the plane, where two points are adjacent if they have unit distance, is unknown, although it is one of 5, 6, or 7. Other open problems concerning the chromatic number of graphs include the Hadwiger conjecture stating that every graph with chromatic number k has a complete graph on k vertices as a minor, the Erdős–Faber–Lovász conjecture bounding the chromatic number of unions of complete graphs that have at most one vertex in common to each pair, and the Albertson conjecture that among k-chromatic graphs the complete graphs are the ones with smallest crossing number.

When Birkhoff and Lewis introduced the chromatic polynomial in their attack on the four-color theorem, they conjectured that for planar graphs G, the polynomial ${\displaystyle P(G,t)}$  has no zeros in the region ${\displaystyle [4,\infty )}$ . Although it is known that such a chromatic polynomial has no zeros in the region ${\displaystyle [5,\infty )}$  and that ${\displaystyle P(G,4)\neq 0}$ , their conjecture is still unresolved. It also remains an unsolved problem to characterize graphs which have the same chromatic polynomial and to determine which polynomials are chromatic.

Polynomial time edit

Determining if a graph can be colored with 2 colors is equivalent to determining whether or not the graph is bipartite, and thus computable in linear time using breadth-first search or depth-first search. More generally, the chromatic number and a corresponding coloring of perfect graphs can be computed in polynomial time using semidefinite programming. Closed formulas for chromatic polynomials are known for many classes of graphs, such as forests, chordal graphs, cycles, wheels, and ladders, so these can be evaluated in polynomial time.

If the graph is planar and has low branch-width (or is nonplanar but with a known branch decomposition), then it can be solved in polynomial time using dynamic programming. In general, the time required is polynomial in the graph size, but exponential in the branch-width.

Exact algorithms edit

Brute-force search for a k-coloring considers each of the ${\displaystyle k^{n}}$  assignments of k colors to n vertices and checks for each if it is legal. To compute the chromatic number and the chromatic polynomial, this procedure is used for every ${\displaystyle k=1,\ldots ,n-1}$ , impractical for all but the smallest input graphs.

Using dynamic programming and a bound on the number of maximal independent sets, k-colorability can be decided in time and space ${\displaystyle O(2.4423^{n})}$ .^[10] Using the principle of inclusion–exclusion and Yates's algorithm for the fast zeta transform, k-colorability can be decided in time ${\displaystyle O(2^{n}n)}$ ^{[9][11][12][13]} for any k. Faster algorithms are known for 3- and 4-colorability, which can be decided in time ${\displaystyle O(1.3289^{n})}$ ^[14] and ${\displaystyle O(1.7272^{n})}$ ,^[15] respectively. Exponentially faster algorithms are also known for 5- and 6-colorability, as well as for restricted families of graphs, including sparse graphs.^[16]

Contraction edit

The contraction ${\displaystyle G/uv}$  of a graph G is the graph obtained by identifying the vertices u and v, and removing any edges between them. The remaining edges originally incident to u or v are now incident to their identification (i.e., the new fused node uv). This operation plays a major role in the analysis of graph coloring.

The chromatic number satisfies the recurrence relation:

${\displaystyle \chi (G)={\text{min}}\{\chi (G+uv),\chi (G/uv)\}}$ 

due to Zykov (1949), where u and v are non-adjacent vertices, and ${\displaystyle G+uv}$  is the graph with the edge uv added. Several algorithms are based on evaluating this recurrence and the resulting computation tree is sometimes called a Zykov tree. The running time is based on a heuristic for choosing the vertices u and v.

The chromatic polynomial satisfies the following recurrence relation

${\displaystyle P(G-uv,k)=P(G/uv,k)+P(G,k)}$ 

where u and v are adjacent vertices, and ${\displaystyle G-uv}$  is the graph with the edge uv removed. ${\displaystyle P(G-uv,k)}$  represents the number of possible proper colorings of the graph, where the vertices may have the same or different colors. Then the proper colorings arise from two different graphs. To explain, if the vertices u and v have different colors, then we might as well consider a graph where u and v are adjacent. If u and v have the same colors, we might as well consider a graph where u and v are contracted. Tutte's curiosity about which other graph properties satisfied this recurrence led him to discover a bivariate generalization of the chromatic polynomial, the Tutte polynomial.

These expressions give rise to a recursive procedure called the deletion–contraction algorithm, which forms the basis of many algorithms for graph coloring. The running time satisfies the same recurrence relation as the Fibonacci numbers, so in the worst case the algorithm runs in time within a polynomial factor of ${\displaystyle \left({\tfrac {1+{\sqrt {5}}}{2}}\right)^{n+m}=O(1.6180^{n+m})}$  for n vertices and m edges.^[17] The analysis can be improved to within a polynomial factor of the number ${\displaystyle t(G)}$  of spanning trees of the input graph.^[18] In practice, branch and bound strategies and graph isomorphism rejection are employed to avoid some recursive calls. The running time depends on the heuristic used to pick the vertex pair.

Greedy coloring edit

The greedy algorithm considers the vertices in a specific order ${\displaystyle v_{1}}$ ,…,${\displaystyle v_{n}}$  and assigns to ${\displaystyle v_{i}}$  the smallest available color not used by ${\displaystyle v_{i}}$ 's neighbours among ${\displaystyle v_{1}}$ ,…,${\displaystyle v_{i-1}}$ , adding a fresh color if needed. The quality of the resulting coloring depends on the chosen ordering. There exists an ordering that leads to a greedy coloring with the optimal number of ${\displaystyle \chi (G)}$  colors. On the other hand, greedy colorings can be arbitrarily bad; for example, the crown graph on n vertices can be 2-colored, but has an ordering that leads to a greedy coloring with ${\displaystyle n/2}$  colors.

For chordal graphs, and for special cases of chordal graphs such as interval graphs and indifference graphs, the greedy coloring algorithm can be used to find optimal colorings in polynomial time, by choosing the vertex ordering to be the reverse of a perfect elimination ordering for the graph. The perfectly orderable graphs generalize this property, but it is NP-hard to find a perfect ordering of these graphs.

If the vertices are ordered according to their degrees, the resulting greedy coloring uses at most ${\displaystyle {\text{max}}_{i}{\text{ min}}\{d(x_{i})+1,i\}}$  colors, at most one more than the graph's maximum degree. This heuristic is sometimes called the Welsh–Powell algorithm.^[19] Another heuristic due to Brélaz establishes the ordering dynamically while the algorithm proceeds, choosing next the vertex adjacent to the largest number of different colors.^[20] Many other graph coloring heuristics are similarly based on greedy coloring for a specific static or dynamic strategy of ordering the vertices, these algorithms are sometimes called sequential coloring algorithms.

The maximum (worst) number of colors that can be obtained by the greedy algorithm, by using a vertex ordering chosen to maximize this number, is called the Grundy number of a graph.

Heuristic algorithms edit

Two well-known polynomial-time heuristics for graph colouring are the DSatur and recursive largest first (RLF) algorithms.

Similarly to the greedy colouring algorithm, DSatur colours the vertices of a graph one after another, expending a previously unused colour when needed. Once a new vertex has been coloured, the algorithm determines which of the remaining uncoloured vertices has the highest number of different colours in its neighbourhood and colours this vertex next. This is defined as the degree of saturation of a given vertex.

The recursive largest first algorithm operates in a different fashion by constructing each color class one at a time. It does this by identifying a maximal independent set of vertices in the graph using specialised heuristic rules. It then assigns these vertices to the same color and removes them from the graph. These actions are repeated on the remaining subgraph until no vertices remain.

The worst-case complexity of DSatur is ${\displaystyle O(n^{2})}$ , where ${\displaystyle n}$  is the number of vertices in the graph. The algorithm can also be implemented using a binary heap to store saturation degrees, operating in ${\displaystyle O((n+m)\log n)}$  where ${\displaystyle m}$  is the number of edges in the graph.^[21] This produces much faster runs with sparse graphs. The overall complexity of RLF is slightly higher than DSatur at ${\displaystyle O(mn)}$ .^[21]

DSatur and RLF are exact for bipartite, cycle, and wheel graphs.^[21]

Parallel and distributed algorithms edit

In the field of distributed algorithms, graph coloring is closely related to the problem of symmetry breaking. The current state-of-the-art randomized algorithms are faster for sufficiently large maximum degree Δ than deterministic algorithms. The fastest randomized algorithms employ the multi-trials technique by Schneider and Wattenhofer.^[22]

In a symmetric graph, a deterministic distributed algorithm cannot find a proper vertex coloring. Some auxiliary information is needed in order to break symmetry. A standard assumption is that initially each node has a unique identifier, for example, from the set {1, 2, ..., n}. Put otherwise, we assume that we are given an n-coloring. The challenge is to reduce the number of colors from n to, e.g., Δ + 1. The more colors are employed, e.g. O(Δ) instead of Δ + 1, the fewer communication rounds are required.^[22]

A straightforward distributed version of the greedy algorithm for (Δ + 1)-coloring requires Θ(n) communication rounds in the worst case − information may need to be propagated from one side of the network to another side.

The simplest interesting case is an n-cycle. Richard Cole and Uzi Vishkin^[23] show that there is a distributed algorithm that reduces the number of colors from n to O(log n) in one synchronous communication step. By iterating the same procedure, it is possible to obtain a 3-coloring of an n-cycle in O(log* n) communication steps (assuming that we have unique node identifiers).

The function log*, iterated logarithm, is an extremely slowly growing function, "almost constant". Hence the result by Cole and Vishkin raised the question of whether there is a constant-time distributed algorithm for 3-coloring an n-cycle. Linial (1992) showed that this is not possible: any deterministic distributed algorithm requires Ω(log* n) communication steps to reduce an n-coloring to a 3-coloring in an n-cycle.

The technique by Cole and Vishkin can be applied in arbitrary bounded-degree graphs as well; the running time is poly(Δ) + O(log* n).^[24] The technique was extended to unit disk graphs by Schneider and Wattenhofer.^[25] The fastest deterministic algorithms for (Δ + 1)-coloring for small Δ are due to Leonid Barenboim, Michael Elkin and Fabian Kuhn.^[26] The algorithm by Barenboim et al. runs in time O(Δ) + log*(n)/2, which is optimal in terms of n since the constant factor 1/2 cannot be improved due to Linial's lower bound. Panconesi & Srinivasan (1996) use network decompositions to compute a Δ+1 coloring in time ${\displaystyle 2^{O\left({\sqrt {\log n}}\right)}}$ .

The problem of edge coloring has also been studied in the distributed model. Panconesi & Rizzi (2001) achieve a (2Δ − 1)-coloring in O(Δ + log* n) time in this model. The lower bound for distributed vertex coloring due to Linial (1992) applies to the distributed edge coloring problem as well.

Decentralized algorithms edit

Decentralized algorithms are ones where no message passing is allowed (in contrast to distributed algorithms where local message passing takes places), and efficient decentralized algorithms exist that will color a graph if a proper coloring exists. These assume that a vertex is able to sense whether any of its neighbors are using the same color as the vertex i.e., whether a local conflict exists. This is a mild assumption in many applications e.g. in wireless channel allocation it is usually reasonable to assume that a station will be able to detect whether other interfering transmitters are using the same channel (e.g. by measuring the SINR). This sensing information is sufficient to allow algorithms based on learning automata to find a proper graph coloring with probability one.^[27]

Computational complexity edit

Graph coloring is computationally hard. It is NP-complete to decide if a given graph admits a k-coloring for a given k except for the cases k ∈ {0,1,2} . In particular, it is NP-hard to compute the chromatic number.^[28] The 3-coloring problem remains NP-complete even on 4-regular planar graphs.^[29] On graphs with maximal degree 3 or less, however, Brooks' theorem implies that the 3-coloring problem can be solved in linear time. Further, for every k > 3, a k-coloring of a planar graph exists by the four color theorem, and it is possible to find such a coloring in polynomial time. However, finding the lexicographically smallest 4-coloring of a planar graph is NP-complete.^[30]

The best known approximation algorithm computes a coloring of size at most within a factor O(n(log log n)²(log n)⁻³) of the chromatic number.^[31] For all ε > 0, approximating the chromatic number within n^1−ε is NP-hard.^[32]

It is also NP-hard to color a 3-colorable graph with 5 colors,^[33] 4-colorable graph with 7 colours,^[33] and a k-colorable graph with ${\displaystyle \textstyle {\binom {k}{\lfloor k/2\rfloor }}-1}$  colors for k ≥ 5.^[34]

Computing the coefficients of the chromatic polynomial is #P-hard. In fact, even computing the value of ${\displaystyle \chi (G,k)}$  is #P-hard at any rational point k except for k = 1 and k = 2.^[35] There is no FPRAS for evaluating the chromatic polynomial at any rational point k ≥ 1.5 except for k = 2 unless NP = RP.^[36]

For edge coloring, the proof of Vizing's result gives an algorithm that uses at most Δ+1 colors. However, deciding between the two candidate values for the edge chromatic number is NP-complete.^[37] In terms of approximation algorithms, Vizing's algorithm shows that the edge chromatic number can be approximated to within 4/3, and the hardness result shows that no (4/3 − ε )-algorithm exists for any ε > 0 unless P = NP. These are among the oldest results in the literature of approximation algorithms, even though neither paper makes explicit use of that notion.^[38]

Scheduling edit

Vertex coloring models to a number of scheduling problems.^[39] In the cleanest form, a given set of jobs need to be assigned to time slots, each job requires one such slot. Jobs can be scheduled in any order, but pairs of jobs may be in conflict in the sense that they may not be assigned to the same time slot, for example because they both rely on a shared resource. The corresponding graph contains a vertex for every job and an edge for every conflicting pair of jobs. The chromatic number of the graph is exactly the minimum makespan, the optimal time to finish all jobs without conflicts.

Details of the scheduling problem define the structure of the graph. For example, when assigning aircraft to flights, the resulting conflict graph is an interval graph, so the coloring problem can be solved efficiently. In bandwidth allocation to radio stations, the resulting conflict graph is a unit disk graph, so the coloring problem is 3-approximable.

Register allocation edit

A compiler is a computer program that translates one computer language into another. To improve the execution time of the resulting code, one of the techniques of compiler optimization is register allocation, where the most frequently used values of the compiled program are kept in the fast processor registers. Ideally, values are assigned to registers so that they can all reside in the registers when they are used.

The textbook approach to this problem is to model it as a graph coloring problem.^[40] The compiler constructs an interference graph, where vertices are variables and an edge connects two vertices if they are needed at the same time. If the graph can be colored with k colors then any set of variables needed at the same time can be stored in at most k registers.

Other applications edit

The problem of coloring a graph arises in many practical areas such as sports scheduling,^[41] designing seating plans,^[42] exam timetabling,^[43] the scheduling of taxis,^[44] and solving Sudoku puzzles.^[45]

Ramsey theory edit

An important class of improper coloring problems is studied in Ramsey theory, where the graph's edges are assigned to colors, and there is no restriction on the colors of incident edges. A simple example is the theorem on friends and strangers, which states that in any coloring of the edges of ${\displaystyle K_{6}}$ , the complete graph of six vertices, there will be a monochromatic triangle; often illustrated by saying that any group of six people either has three mutual strangers or three mutual acquaintances. Ramsey theory is concerned with generalisations of this idea to seek regularity amid disorder, finding general conditions for the existence of monochromatic subgraphs with given structure.

Other colorings edit

Coloring can also be considered for signed graphs and gain graphs.

• Critical graph
• Graph coloring game
• Graph homomorphism
• Hajós construction
• Mathematics of Sudoku
• Multipartite graph
• Uniquely colorable graph

• High-Performance Graph Colouring Algorithms Suite of 8 different algorithms (implemented in C++) used in the book A Guide to Graph Colouring: Algorithms and Applications (Springer International Publishers, 2015).
• Graph Coloring Page by Joseph Culberson (graph coloring programs)
• CoLoRaTiOn by Jim Andrews and Mike Fellows is a graph coloring puzzle
• Links to Graph Coloring source codes
• Code for efficiently computing Tutte, Chromatic and Flow Polynomials Archived 2008-04-16 at the Wayback Machine by Gary Haggard, David J. Pearce and Gordon Royle
• A graph coloring Web App by Jose Antonio Martin H.