Discrete Mathematics

GRAPH THEORY 4

Arindam Chakravorty
 Graph Coloring

Graph Coloring - Process of assigning colors to the vertices of a graph, such

that no two adjacent vertices of the graph are colored with the same color.
In other words, the end vertices of no edge should have the same color.

This process of assigning colors to the vertices of a graph is called proper

coloring.
 Graph Coloring

The maximum number of colors that you can use is equal to the number of
vertices (in the given figure = 6).
Our concern is what is the minimum number of colors required to properly
color a graph?
The given graph may be colored with a minimum of 2 colors.
 Graph Coloring

A graph containing a complete graph of r-vertices is at least r-chromatic.

For example every graph having a triangle is at least 3-chromatic.
 Graph Coloring

A cycle graph with n vertices is 2-chromatic if n is even and 3-chromatic if n

is odd.

Every tree with two or more vertices is 2-chromatic.

 Graph Coloring

Let 𝐺 be a nonempty graph. Then 𝜒 𝐺 = 2 if and only if 𝐺 is bipartite.

-Proof left as an exercise

A tree is a bipartite graph.

A graph with at least one edge is 2-chromatic if and only if it has no cycle of odd
length.
Let G be a connected graph with no odd cycle. G

Consider any spanning tree T of G and color it. T

Add the chords to tree. Since G has no cycle of odd length G

end vertices of every added chord have different colors.
 Graph Coloring

For any graph 𝐺, 𝜒 𝐺 ≤ Δ G + 1 , Δ(G) is the maximum degree of any

vertex.

Consider any vertex v of G.

The neighbours of v can have at most Δ(G) number of colors.

Hence, along with one more color for v, the maximum number of colors that is
required is Δ(G) + 1.

This can be proved by induction also.

Hence Δ(G) + 1 is an upper bound to the chromatic number of a graph G.