Total coloring

From Wikipedia, the free encyclopedia
  (Redirected from Total chromatic number)
Jump to navigation Jump to search
Proper total coloring of Foster cage with 6 colors. The total chromatic number of this graph is 6 since the degree of each vertex is 5 (5 adjacent edges + 1 vertex = 6).

In graph theory, total coloring is a type of graph 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 edges and no edge and its endvertices are assigned the same color. The total chromatic number χ″(G) of a graph G is the least number of colors needed in any total coloring of G.

The total graph T = T(G) of a graph G is a graph such that (i) the vertex set of T corresponds to the vertices and edges of G and (ii) two vertices are adjacent in T if and only if their corresponding elements are either adjacent or incident in G. Then total coloring becomes a (proper) vertex coloring of the total graph. A total coloring is a partitioning of the vertices and edges of the graph into total independent sets.

Some properties of χ″(G):

  1. χ″(G) ≥ Δ(G) + 1.
  2. χ″(G) ≤ Δ(G) + 1026. (Molloy, Reed 1998)
  3. χ″(G) ≤ Δ(G) + 8 ln8(Δ(G)) for sufficiently large Δ(G). (Hind, Molloy, Reed 1998)
  4. χ″(G) ≤ ch′(G) + 2.

Here Δ(G) is the maximum degree; and ch′(G), the edge choosability.

Total coloring arises naturally since it is simply a mixture of vertex and edge colorings. The next step is to look for any Brooks-typed or Vizing-typed upper bound on the total chromatic number in terms of maximum degree.

It turns out that the total coloring version of maximum degree upper bound is a difficult problem and has eluded mathematicians for 40 years. A trivial lower bound for the total chromatic number is the increment of the maximum degree, that is, Δ(G) + 1 (if equality occurs, it is called a Class 1 graph). Some graphs (like cycles of length and complete bipartite graphs of the form ) need Δ(G) + 2 colors. No graph has been found with total chromatic number greater than Δ(G) + 2. Thus leads to the speculation that every graph needs either Δ(G) + 1 or Δ(G) + 2 colors, but never more:

Total coloring conjecture. (Behzad, Vizing)

χ″(G) ≤ Δ(G) + 2.

Apparently, the term "total coloring" and the statement of total coloring conjecture were independently introduced by Behzad and Vizing in numerous occasions between 1964 and 1968. See [Jensen, Toft 1995] for details. The conjecture is known to hold for a few important classes of graphs, such as all bipartite graphs and most planar graphs except those with maximum degree 6. The planar case can be completed if Vizing's planar graph conjecture is true. Also, if the list coloring conjecture is true, then χ″(G) ≤ Δ(G) + 3.

Results related to total coloring have been obtained. For example, Kilakos and Reed (1993) proved that the fractional chromatic number of the total graph of a graph G is at most Δ(G) + 2.

Some properties of the line graph and the total graph:

T = T(G) is Eulerian if and only if the line graph L(G) is Eulerian.

References[edit]

  • Hind, Hugh; Molloy, Michael; Reed, Bruce (1998). "Total coloring with Δ + poly(logΔ) colors". SIAM Journal on Computing. 28 (3): 816–821. doi:10.1137/S0097539795294578.
  • Jensen, Tommy R.; Toft, Bjarne (1995). Graph coloring problems. New York: Wiley-Interscience. ISBN 0-471-02865-7.
  • Kilakos, Kyriakos; Reed, Bruce (1993). "Fractionally colouring total graphs". Combinatorica. 13 (4): 435–440. doi:10.1007/BF01303515.
  • Molloy, Michael; Reed, Bruce (1998). "A bound on the total chromatic number". Combinatorica. 18 (2): 241–280. doi:10.1007/PL00009820.