Vizing's theorem

From Wikipedia, the free encyclopedia

In graph theory, Vizing's theorem (named for Vadim G. Vizing who published it in 1964) states that the edges of every undirected graph may be colored using a number of colors that is at most one larger than the maximum degree $Δ$ of the graph.

At least $Δ$ colors are always necessary, so the undirected graphs may be partitioned into two classes: "class one" graphs for which $Δ$ colors suffice, and "class two" graphs for which $Δ + 1$ colors are necessary.

Examples

When $Δ = 1$ , the graph $G$ must itself be a matching, with no two edges adjacent, and its edge chromatic number is one. That is, all graphs with $Δ(G) = 1$ are of class one.

When $Δ = 2$ , the graph $G$ must be a disjoint union of paths and cycles. If all cycles are even, they can be 2-edge-colored by alternating the two colors around each cycle. However, if there exists at least one odd cycle, then no 2-edge-coloring is possible. That is, a graph with $Δ = 2$ is of class one if and only if it is bipartite.

Multigraphs do not in general obey Vizing's theorem. For instance, the multigraph formed by doubling each edge of a triangle has maximum degree four but cannot be edge-colored with fewer than six colors.

Classification of graphs

Several authors have provided additional conditions that classify some graphs as being of class one or class two, but do not provide a complete classification. For instance, if the vertices of the maximum degree $Δ$ in a graph $G$ form an independent set, or more generally if the induced subgraph for this set of vertices is a forest, then $G$ must be of class one.^[1]

Erdős & Wilson (1977) showed that almost all graphs are of class one. That is, in the Erdős–Rényi model of random graphs, in which all $n$ -vertex graphs are equally likely, let $p (n)$ be the probability that an $n$ -vertex graph drawn from this distribution is of class one; then $p (n)$ approaches one in the limit as $n$ goes to infinity. For more precise bounds on the rate at which $p (n)$ converges to one, see Frieze et al. (1988).

Planar graphs

Vizing (1965) showed that a planar graph is of class one if its maximum degree is at least eight. In contrast, he observed that for any maximum degree in the range from two to five, there exist planar graphs of class two. For degree two, any odd cycle is such a graph, and for degree three, four, and five, these graphs can be constructed from platonic solids by replacing a single edge by a path of two adjacent edges.

In Vizing's planar graph conjecture, Vizing (1965) states that all simple, planar graphs with maximum degree six or seven are of class one, closing the remaining possible cases. Sanders & Zhao (2001) partially proved Vizing's planar graph conjecture by showing that all planar graphs with maximum degree seven are of class one. Thus, the only case of the conjecture that remains unsolved is that of maximum degree six. This conjecture has implications for the total coloring conjecture.

The planar graphs of class two constructed by subdivision of the platonic solids are not regular: they have vertices of degree two as well as vertices of higher degree. The four color theorem, on vertex coloring of planar graphs, is equivalent to the statement that every bridgeless 3-regular planar graph is of class one (Tait 1880). This statement is now known to be true, due to the proof of the four color theorem by Appel & Haken (1976).

Graphs on nonplanar surfaces

In 1969, Branko Grünbaum conjectured that every 3-regular graph with a polyhedral embedding on any two-dimensional oriented manifold such as a torus must be of class one. In this context, a polyhedral embedding is a graph embedding such that every face of the embedding is topologically a disk and such that the dual graph of the embedding is simple, with no self-loops or multiple adjacencies. If true, this would be a generalization of the four color theorem, which was shown by Tait to be equivalent to the statement that 3-regular graphs with a polyhedral embedding on a sphere are of class one. However, Kochol (2009) showed the conjecture to be false by finding snarks that have polyhedral embeddings on high-genus orientable surfaces. Based on this construction, he also showed that it is NP-complete to tell whether a polyhedrally embedded graph is of class one.^[2]

Algorithms

Misra & Gries (1992) describe a polynomial time algorithm for coloring any graph with $Δ + 1$ colors, where $Δ$ is the maximum degree of the graph. That is, the algorithm uses the optimal number of colors for graphs of class two, and uses at most one more color than necessary for all graphs. Their algorithm follows the same strategy as Vizing's original proof of his theorem: it starts with an uncolored graph, and then repeatedly finds a way of recoloring the graph in order to increase the number of colored edges by one.

More specifically, suppose that $uv$ is an uncolored edge in a partially colored graph. The algorithm of Misra and Gries may be interpreted as constructing a directed pseudoforest $P$ (a graph in which each vertex has at most one outgoing edge) on the neighbors of $u$ : for each neighbor $p$ of $u$ , the algorithm finds a color $c$ that is not used by any of the edges incident to $p$ , finds the vertex $q$ (if it exists) for which edge $uq$ has color $c$ , and adds $pq$ as an edge to $P$ . There are two cases:

If the pseudoforest $P$ constructed in this way contains a path from $v$ to a vertex $w$ that has no outgoing edges in $P$ , then there is a color $c$ that is available both at $u$ and $w$ . Recoloring edge $uw$ with color $c$ allows the remaining edge colors to be shifted one step along this path: for each vertex $p$ in the path, edge $up$ takes the color that was previously used by the successor of $p$ in the path. This leads to a new coloring that includes edge $uv$ .
If, on the other hand, the path starting from $v$ in the pseudoforest $P$ leads to a cycle, let $w$ be the neighbor of $u$ at which the path joins the cycle, let $c$ be the color of edge $uw$ , and let $d$ be a color that is not used by any of the edges at vertex $u$ . Then swapping colors $c$ and $d$ on a Kempe chain either breaks the cycle or the edge on which the path joins the cycle, leading to the previous case.

With some simple data structures to keep track of the colors that are used and available at each vertex, the construction of $P$ and the recoloring steps of the algorithm can all be implemented in time $O(n)$ , where $n$ is the number of vertices in the input graph. Since these steps need to be repeated $m$ times, with each repetition increasing the number of colored edges by one, the total time is $O(mn)$ .

In an unpublished technical report, Gabow et al. (1985) claimed a faster $O(m{\sqrt n}\log n)$ time bound for the same problem of coloring with $Δ + 1$ colors.

History

In both Gutin & Toft (2000) and Soifer (2008), Vizing mentions that his work was motivated by a theorem of Shannon (1949) showing that multigraphs could be colored with at most $(3/2)Δ$ colors. Although Vizing's theorem is now standard material in many graph theory textbooks, Vizing had trouble publishing the result initially, and his paper on it appears in an obscure journal, Diskret. Analiz.^[3]

Notes

↑ Fournier (1973).
↑ Kochol (2010).
↑ The full name of this journal was Akademiya Nauk SSSR. Sibirskoe Otdelenie. Institut Matematiki. Diskretny˘ı Analiz. Sbornik Trudov. It was renamed Metody Diskretnogo Analiza in 1980 (the name given for it in Gutin & Toft (2000)) and discontinued in 1991 .

References

Appel, K.; Haken, W. (1976), "Every planar map is four colorable", Bulletin of the American Mathematical Society 82 (5): 711–712, doi:10.1090/S0002-9904-1976-14122-5, MR 0424602 .
Erdős, Paul; Wilson, Robin J. (1977), "Note on the chromatic index of almost all graphs", Journal of Combinatorial Theory, Series B 23 (2–3): 255–257, doi:10.1016/0095-8956(77)90039-9 .
Fournier, Jean-Claude (1973), "Colorations des arêtes d'un graphe", Cahiers du Centre d'Études de Recherche Opérationnelle 15: 311–314, MR 0349458 .
Frieze, Alan M.; Jackson, B.; McDiarmid, C. J. H.; Reed, B. (1988), "Edge-colouring random graphs", Journal of Combinatorial Theory, Series B 45 (2): 135–149, doi:10.1016/0095-8956(88)90065-2, MR 961145 .
Gabow, Harold N.; Nishizeki, Takao; Kariv, Oded; Leven, Daniel; Terada, Osamu (1985), Algorithms for edge-coloring graphs, Tech. Report TRECIS-8501, Tohoku University .
Gutin, Gregory; Toft, Bjarne (December 2000), "Interview with Vadim G. Vizing", European Mathematical Society Newsletter 38: 22–23 .
Kochol, Martin (2009), "Polyhedral embeddings of snarks in orientable surfaces", Proceedings of the American Mathematical Society 137, pp. 1613–1619 .
Kochol, Martin (2010), "Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface", Discrete Applied Mathematics 158 (16): 1856–1860, doi:10.1016/j.dam.2010.06.019, MR 2679785 .
Misra, J.; Gries, David (1992), "A constructive proof of Vizing's Theorem", Information Processing Letters 41 (3): 131–133, doi:10.1016/0020-0190(92)90041-S .
Sanders, Daniel P.; Zhao, Yue (2001), "Planar graphs of maximum degree seven are class I", Journal of Combinatorial Theory, Series B 83 (2): 201–212, doi:10.1006/jctb.2001.2047 .
Shannon, Claude E. (1949), "A theorem on coloring the lines of a network", J. Math. Physics 28: 148–151, MR 0030203 .
Soifer, Alexander (2008), The Mathematical Coloring Book, Springer-Verlag, pp. 136–137, ISBN 978-0-387-74640-1 .
Tait, P. G. (1880), "Remarks on the colourings of maps", Proc. R. Soc. Edinburgh 10: 729 .
Vizing, V. G. (1964), "On an estimate of the chromatic class of a p-graph", Diskret. Analiz. 3: 25–30, MR 0180505 .
Vizing, V. G. (1965), "Critical graphs with given chromatic class", Metody Diskret. Analiz. 5: 9–17 . (In Russian.)

External links

Proof of Vizing's theorem at PlanetMath.

This article is issued from Wikipedia. The text is available under the Creative Commons Attribution/Share Alike; additional terms may apply for the media files.