List coloring


In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors. It was first studied in the 1970s in independent papers by Vizing
and by Erdős, Rubin, and Taylor.

Definition

Given a graph G and given a set L of colors for each vertex v, a list coloring is a choice function that maps every vertex v to a color in the list L. As with graph coloring, a list coloring is generally assumed to be proper, meaning no two adjacent vertices receive the same color. A graph is k-choosable if it has a proper list coloring no matter how one assigns a list of k colors to each vertex. The choosability ch of a graph G is the least number k such that G is k-choosable.
More generally, for a function f assigning a positive integer f to each vertex v, a graph G is f-choosable if it has a list coloring no matter how one assigns a list of f colors to each vertex v. In particular, if for all vertices v, f-choosability corresponds to k-choosability.

Examples

Consider the complete bipartite graph G = K2,4, having six vertices A, B, W, X, Y, Z such that A and B are each connected to all of W, X, Y, and Z, and no other vertices are connected. As a bipartite graph, G has usual chromatic number 2: one may color A and B in one color and W, X, Y, Z in another and no two adjacent vertices will have the same color. On the other hand, G has list-chromatic number larger than 2, as the following construction shows: assign to A and B the lists and. Assign to the other four vertices the lists,,, and. No matter which choice one makes of a color from the list of A and a color from the list of B, there will be some other vertex such that both of its choices are already used to color its neighbors. Thus, G is not 2-choosable.
On the other hand, it is easy to see that G is 3-choosable: picking arbitrary colors for the vertices A and B leaves at least one available color for each of the remaining vertices, and these colors may be chosen arbitrarily.
K3,27 with three colors per vertex. No matter which colors are chosen for the three central vertices, one of the outer 27 vertices will be uncolorable, showing that the list chromatic number of K3,27 is at least four.
More generally, let q be a positive integer, and let G be the complete bipartite graph Kq,qq. Let the available colors be represented by the q2 different two-digit numbers in radix q.
On one side of the bipartition, let the q vertices be given sets of colors in which the first digits are equal to each other, for each of the q possible choices of the first digit i.
On the other side of the bipartition, let the qq vertices be given sets of colors in which the first digits are all distinct, for each of the qq possible choices of the q-tuple
The illustration shows a larger example of the same construction, with q = 3.
Then, G does not have a list coloring for L: no matter what set of colors is chosen for the vertices on the small side of the bipartition, this choice will conflict with all of the colors for one of the vertices on the other side of the bipartition. For instance if the vertex with color set is colored 01, and the vertex with color set is colored 10, then the vertex with color set cannot be colored.
Therefore, the list chromatic number of G is at least q + 1.
Similarly, if, then the complete bipartite graph Kn, n is not k-choosable. For, suppose that 2k − 1 colors are available in total, and that, on a single side of the bipartition, each vertex has available to it a different k-tuple of these colors than each other vertex. Then, each side of the bipartition must use at least k colors, because every set of k − 1 colors will be disjoint from the list of one vertex. Since at least k colors are used on one side and at least k are used on the other, there must be one color which is used on both sides, but this implies that two adjacent vertices have the same color. In particular, the utility graph K3,3 has list-chromatic number at least three, and the graph K10,10 has list-chromatic number at least four.

Properties

For a graph G, let χ denote the chromatic number and Δ the maximum degree of G. The list coloring number ch satisfies the following properties.
  1. ch ≥ χ. A k-list-colorable graph must in particular have a list coloring when every vertex is assigned the same list of k colors, which corresponds to a usual k-coloring.
  2. ch cannot be bounded in terms of chromatic number in general, that is, there is no function f such that ch ≤ f holds for every graph G. In particular, as the complete bipartite graph examples show, there exist graphs with χ = 2 but with ch arbitrarily large.
  3. ch ≤ χ ln where n is the number of vertices of G.
  4. ch ≤ Δ + 1.
  5. ch ≤ 5 if G is a planar graph.
  6. ch ≤ 3 if G is a bipartite planar graph.

    Computing choosability and (''a'', ''b'')-choosability

Two algorithmic problems have been considered in the literature:
  1. k-choosability: decide whether a given graph is k-choosable for a given k, and
  2. -choosability: decide whether a given graph is f-choosable for a given function.
It is known that k-choosability in bipartite graphs is -complete for any k ≥ 3, and the same applies for 4-choosability in planar graphs, 3-choosability in planar triangle-free graphs, and -choosability in bipartite planar graphs. For P5-free graphs, that is, graphs excluding a 5-vertex path graph, k-choosability is fixed-parameter tractable.
It is possible to test whether a graph is 2-choosable in linear time by repeatedly deleting vertices of degree zero or one until reaching the 2-core of the graph, after which no more such deletions are possible. The initial graph is 2-choosable if and only if its 2-core is either an even cycle or a theta graph formed by three paths with shared endpoints, with two paths of length two and the third path having any even length.

Applications

List coloring arises in practical problems concerning channel/frequency assignment.