Graph coloring is giving the color on vertice ,

edges , or maps. The colors used in the coloring is red ,

white , yellow , green , blue , black and so on , but also
the colors are written in the form of positive integer
numbers , such as 1 , 2 , 3 , .... At this graph coloring ,
many colors are used cultivated as little as possible
Definition 1.1
Let G be a simple graph . Vertices coloring is the color on each
vertex G such that the vertices are related ( adjacent ) gets a
different color .
Definition 1.2
Chromatic number of a graph is the smallest number that shows
the colors needed to color the vertices of G. The chromatic
numbers denoted by " ( G ) "
We will give the colors to all of the vertices at the graph in Figure
below:
Figure ( i )
The vertices can be given by 5different colors , those are red , yellow,
green, black , and white .
Figure(ii)
Theverticescanbegivenby4different
colors,thosearered,yellow,green,andblack.
Figure(iii)
Theverticescanbegivenby3different
colors,thosearered,yellow,andgreen.
Becausethecolorsareusedforcoloringtheverticesofthegraphisat
leastthreethenthechromaticnumbersare3,
((G)=3)
R
Y
G
B
G
G
R
R
Y
Y
Anedge coloring of agraphis an assignment of labels (colors) to
the edges so that no two adjacent edges have the same color.
For example, the figure above to the right shows an edge coloring
of agraphby the colors red, purple, blue, yellowand green.
1
2
3
4
5
(G)
Edge colorings are one of several different types of graph
coloring. The edge-coloring problemasks whether it is possible
to color the edges of a given graph using at most k different colors,
for a given value of k, or with the fewest possible colors.
From the figure beside, we can see that
Edge (1,2) is adjacent with (1,5), (1,3),
(1,4), (2,3), (2,5) so those edge must be given
different colors, these are purple, yellow, blue,
green, and red.
Edge (1,3) is not adjacent with (5,4), so those edge can be colored
with the same colors blue.
Edge (1,4) is not adjacent with (2,3), so those edge can be colored
with the same colors green.
Edge (1,5) is not adjacent with (3,4), so those edge can be colored
with the same colors yellow.
Edge (2,5) is adjacent with (1,2), (1,5), (2,3), and (5,4), so we must
give another color that is red.
1
2
3
4
5
(G)
The relationship between degree and the chromatics
number of edge coloring:
(G) (The chromatic index is greater than or equal to
the max degree)
Fromthe picture we cansee that
the chromatic index of the beside
graph is 5because there are 5
difference colors. And the maximum
degree of that graph if 4that exist in vertex 1.
1
2
3
4
5
(G)
Theorem :
Prove that the chromatic number of a complete graph k
n
is n
Proof:
1. Because k
n
complete graph, every vertices on k
n
is adjacent to another vertices.
2. Each vertices that adjacent must have different color.
Because k
n
has n vertices, then according to 1 and 2 that the colors used in k
n
is
n, so its chromatic number (k
n
) = n
What is the chromatic number of a graph k
5
?
The colors used for coloring k
5
there are 5, red, yellow, white, black, green.
so (k
5
) = 5
Prove that the chromatic number from circle C
n
:
i. (C
n
) = 2, if n is even
ii. (C
n
) = 3, if n is od
Proof :
i. Will be proved if n is even, then (C
n
) = 2
Let V (C
n
) = {v
1
, v
2
, v
3
, ...., V
2k-1
, V
2k
}
1. Vertices v
1
, v
3
, v
5
, ..., v
2k-1
are not adjacent, so it should be the same color, for
example red.
2. Vertices v
2
, v
4
, v
6
, ..., v
2k
not adjacent, so it should be the same color, for example
white.
3. Vertices that are adjacent (v
1
, v
2
), (v
2
, v
3
), (v
3
, v
4
), ....., (v
2k-1
, v
2k
), (v
2k
, v
1
) so, from
(1), (2), and (3) can be obtained that the chromatic number C
n
with n even is
(C
n
) = 2
ii. Will be proved if n is odd, then (C
n
) = 3
Let V (C
n
) = {v
1
, v
2
, v
3
, ...., V
2k-1
, V
2k
}
1. Vertices v
1
, v
3
, v
5
, ..., v
2k-1
are not adjacent, so it should be the same color, for example
red.
2. Vertices v
2
, v
4
, v
6
, ..., v
2k
not adjacent, so it should be the same color, for example white.
3. Vertices that are adjacent (v
1
, v
2
), (v
2
, v
3
), (v
3
, v
4
), ....., (v
2k-1
, v
2k
), (v
2k
, v
2k+1
), (v
2k+1
,v
1
)
From (1), (2), obtained two colors are used, but because of v
2k
relate to v
2k+1
,and
v
2k+1
adjacent to v
1
, means for v
2k
is white and v
1
is red, then v
2k+1
should not be red
and white, so v
2k+1
given the other colors, such as yellow. This indicates that if n is
odd, then (C
n
) = 3. So from (1), (2), and (3), we obtain that C
n
with chromatic
number C
n
with n is odd (C
n
) = 3
Example:
What is the chromatic number of a graph C5 and C6?
In the figure it can be seen that (C
5
) = 3 and (C
6
) = 2
Prove that if T is a tree, then (T) = 2
Proof:
Because T is a tree, then T is a connected graph that does not have a loop. Means T
has a simple open path. This indicates that every vertices on the path using at least
two colors. It resulted that the coloring onT using at least two colors, so (T) =2
Example:
what is the number of chromatic fromthis tree graph?
In the picture it appears that the colors used on the tree at least two, so (T) = 2
This algorithm gives the way to coloring a graf by labelling the vertices appropriate with
the number of the degree that the vertices has.
Step 1 ( Labelling the vertices with the degrees.
Labelling vertice V
1
, V
2
, V
3
, .... , V
n
so that deg(V
1
), deg(V
2
) , deg(V
3
) , .... , deg(V
n
) (
This bound can be broken randomly).
Step 2 ( coloring the uncolored vertice and the uncolored adjacent vertices )
Coloring the first uncolored vertice in the list of vertices. Doing it for all vertices in a
series, giving new color for distinct vertices with colored vertices.
Step 3 (Graph has been colored?)
If some of the vertices hasnt colored yet, back to the step 2.
Step 4 ( Finish)
Coloring graph has been done.
Example 1.
At least how many colors that need to coloring this graphs vertices?
a
f
e
d
c b
Solutions.
Firstly, we have to label the vertices from the highest degree, like the table below:
Then the graph become :
Vertices' degree
4 3 2 1
vertice c e a b d f
vertice's label V
1
V
2
V
3
V
4
V
5
V
6
V
3
V
6
V
2
V
5
V
1
V
4
B
R
B
G
R G
(a) (b)
Coloring graph with Welsh and Powells Algorithm, the adjacent vertices are :
Adjacent vertice with V
1
are V
2
, V
3
, V
4
and V
5
Adjacent vertice with V
2
are V
1
, V
4
and V
6
Adjacent vertice with V
3
are V
1
and V
5
Adjacent vertice with V
4
are V
1
and V
2
Adjacent vertice with V
5
are V
1
and V
3
Adjacent vertice with V
6
are V
2
The first uncolored vertice in the list is V
1
, give the red color (R), then
find distinct vertice with V
1,
that is V
6
and also give red one.
Find vertices that distinct with V
1
and V
6
( nothing ).
Continue with V
2
and give blue color, find the vertice that distinct with V
2
, that is V
3
. Give the blue color.
Then, find the vertice that distinct with V
2
and V
3
(nothing).
Continue with V
4
and give green color, find the vertice that distinct with
V
4
, that is V
5
. Give the green color.
So, at least there are three (3) Colors that used in the graph that is red,
blue and green.
Map coloring is giving color to abounded region/ areainplanar graphG
so that the adjacent region has different color, while the region that
bounded by avertice may have same color. Two regions is said adjacent if
both of the region are federation edge, while region that bounded by
vertices is called distinct region.
The graph shows that d
1
adjacent with d
2
, d
2
adjacent with d
3
,.
Ajdacent region is given different color, while distinct region is given
the same color. If d
1
is given red then another region that can be
given red are d
3
, d
4
, d
6
. While d
2
and d
4
are given white. So the
planar graph is using at least 2 colors, or the chromatic number of the
graph is 2.
THANK YOU