VERTEX COLOURING

DEFINITION 1.3
A k - vertex colouring of G is an assignment of k colours, 1,2,3...,k, to
the vertices of G.

EXAMPLE :

DEFINITION 1.4
The colouring is proper if no two distinct adjacent vertices have the
same colour.
Thus a proper k - vertex colouring of a loopless graph G is a partition
(V1 , V2 , ..., Vk ) of V into k (possibly empty) independent sets.

DEFINITION 1.5
G is k- vertex colourable if G has a proper k - vertex colouring.

4
EXAMPLE :

DEFINITION 1.6
The chromatic number, Ψ(G), of G is the minimum k for which G is
k - colourable. If Ψ(G) = k, G is said to be k - vertex chromatic.

EXAMPLE :

5
 EDGE COLOURING

DEFINITION 1.7
A k - edge colouring C of a loopless graph G is an assignment of k
colours 1,2,...,k to the edges of G.
An edge colouring of a graph G is a funtion f : E(G)→ C, where C is set of
distinct colour.

EXAMPLE :

DEFINITION 1.8
The colouring C is proper if no two adjacent edges have the same colour.

DEFINITION 1.9
G is k - edge colourable if G has a proper k - edge colouring.

6
EXAMPLE:

DEFINITION 1.10
The edge chromatic number Ψ′ (G) of a loopless graph G, is the
minimum k for which G is k - edge colourable. G is k - edge chromatic if
Ψ′ (G) = k.

EXAMPLE:

7
 TOTAL COLOURING

DEFINITION 1.11
A total colouring of a graph a G is an assignment of colours to both the
vertices and edges of G, such that no two adjacent or incident vertices and
egdes of are assigned the same colours.

EXAMPLE:

DEFINITION 1.12
A total colouring is proper if

(i) adjacent vertices have different colours.

(ii) incident edges have different colours and

(iii) every edge has a colour that is different from each of its end vertices.

8
EXAMPLE:

DEFINITION 1.13
The total chromatic number is the minimum number of colours needed
to total colour G and it is denoted by Ψ′′ (G) .

EXAMPLE:

9
Step :2
Plotting the vertices in such a way that the courses enrolled by the students
does not make conflict.

Step :3
Start giving colouring on the vertices to find the minimum number of time
slots that can be allotted for the students.

(i) Plotting Red colour for the vertex V1 for the students who opted MS
Tools.

(ii) From MS Tools extending the edges to mark the students who opted
other courses in the pair of MS Tools.
The students who had taken MS Tools also taken, Programming,
Photoshop and Coral Draw and Auto CAD as their second course.
v1 , v2 , v4 , v5 and v6 are adjacent.

26
(iii) Moving on to the next step,join the vertices and give colouring for the
next pair of coureses.

This shows the students who took the course programming also
associated with MS Tools,3-D Animation, Photoshop, Ethical Hacking and
Cyber law.

From the vertex v2 , it connects to the vertices v1 , v3 , v4 , v7 and v8 .

(iv) From the vertex v3 , extend the edges to connect the courses to their
pairs.

This shows the students who opted for course 3-D Animation also
chooses MS Tools, Corel Draw and Cyber law as their second option.

So, from the vertex v3 the edges lines up to the vertices v1 , v5 and v8 .

27
(v) Now, moving further, from the vertex v4 stretches its edges towards, the
courses which has been paired with it.
This shows the students who opted for course Photoshop also chooses MS
Tools,Programming, Auto CAD, and Ethical Hacking as their second
option.
So, from the vertex v4 the courses connect towards to the vertices v1 , v2 , v6
and v7 .

28
(vi) Moving forward to the next step, the vertex v5 holds the vertices which
are all its corresponding pair courses.

The above graph describes that the students who chosen Corel Draw, in
addition they choose MS Tools, Programming, 3-D Animation, Auto CAD
as their next preference.

So from the vertex v5 the courses connect towards to the vertices

v1 , v2 , v3 and v6 .

(vii) Then, the next step is to take the vertex v6 extends its vertices to its
paired courses.

From the above graph, we come to know that the candidates who had
chosen Auto CAD, also chooses MS Tools, Photoshop, Corel Draw and
Ethical Hacking.

29
(viii) The final step is to connect the last vertex v7 with its corresponding
vertices.Stepping forward to the next procedure, the vertex v7 , pairs with
the vertices v1 , v2 , v4 , v6 and v8 , corresponding to their courses.
The following graph insists that the course Ethical Hacking taken students
also taken MS Tools, Programming, Photoshop, Auto CAD and Cyber law
as their choices.
Now, we have connected all the vertices with their corresponding courses.

30
Step :4
To determine the minimum time slots for the courses, given that there will
be only two lecture halls available.

By grouping the colours, we can deduce the perfect time slots for the
courses without clashing with other courses at a time.

Time slot 1 : Red colour - v1 and v8 - MS Tools and Cyber Law.

Time slot 2 : Blue colour - v2 and v6 - Programming and Auto CAD.

Time slot 3 : Purble colour - v3 and v4 - 3D Animations and Photoshop.

Time slot 4 : Yellow colour - v5 and v7 - Corel Draw and Ethical

Hacking.

Hence, the Chromatic number Ψ(G) = 4 .

Therefore, the minimum time slots for the given eight courses are four. There
will be four classes will be held per day in two lecture classes which the courses
will not clash with each other.

31