2MATHMWORLD – MODULE 3

ENGR. MARIA CRISTINA A. SICAT

Math & Sciences Department
Holy Angel University
} Graph Coloring is an assignment of colors (or any
distinct marks) to the vertices of a graph. Strictly
speaking, a coloring is a proper coloring if no two
adjacent vertices have the same color.

} Chromatic number – is the minimum number of colors

needed to color a graph so that no edge connects
vertices of the same color.
} Many problems can be formulated as a
graph coloring problem including map
coloring, scheduling, preparing a time
table, register allocation in a
microprocessor, frequency assignment in
mobile radios, channel assignment, and
pattern matching
} Definition: A graph is planar if it can be drawn in a
plane without edge-crossings.
v1 v2 v3

v4 v5 v6

Planar Non Planar

} A graph (or multigraph) G is called planar if G can be drawn in
the plane with its edges intersecting only at vertices of G,
such a drawing of G is called an embedding of G in the plane.

Application Example: Circuit design (cannot overlap wires on

board)

Representation examples: K1,K2,K3,K4 are planar, Kn for n>4

are non-planar

A B A B

C D C D

K4
} Representation examples: Q3
Planar Graphs
Theorem : Euler's planar graph theorem
For a connected planar graph or multigraph:
v–e+r=2

number number
number of regions (faces)
of vertices of edges
Example of Euler’s theorem

A planar graph divides the plane

R1 into several regions (faces), one
K4 R2 R4
of them is the infinite region.
v = 4, e = 6, r = 4,
R3
v–e+r=2
4–6+4=2
2=2
} Representation examples: Q3

v = 8, e = 12, r = 6,
v–e+r=2
8 – 12 + 6 = 2
2=2
} 2-Colorable Graph Theorem: A graph is 2-colorable
if and only if it has no circuits that consist of an odd
number of vertices.

} The Four-Color Theorem: For every planar graph,

the chromatic number is ≤ 4.
◦ Was posed as a conjecture in the 1850’s.
◦ Finally proven in 1976 (Appel and Haken) by the aid of
computers.
} The Four color theorem: the chromatic number of a
planar graph is no greater than 4
} Example: G1 chromatic number = 3,
G2 chromatic number = 4
} (Most proofs rely on case by case analysis).

G1 G2
} Similar to vertex coloring, except edges are colored.
} Adjacent edges have different colors.
A B C
D

H
G
F
E

6.4 Graph Coloring 13

A B C
D

H
F
E G

6.4 Graph Coloring 14

A B C
D

H
F
E G

6.4 Graph Coloring 15

A B C
D

H
F
E G

6.4 Graph Coloring 16

A student council consists of 7 students a, b, c, d, e, f, g.
Each student belongs to several of 6 committees.
These committees meet weekly for an hour at the same time
(noon). All members must be present before business can
be conducted. There are lots of meeting rooms available.
Below are the committees and the corresponding members:
Executive (E) = {a, b, c} Ways/Means (W) = {b, d, e}
Finance (F) = {a, b, d} By-Laws (B) = {a, c, g}
Social (S) = {e, f} Recruiting (R) = {c, e, f, g}
a. Construct a planar graph corresponding to the given
condition.
b. By graph coloring method, find the fewest number of
days required to schedule all 6 committee meetings?
c. Which meetings should be scheduled
on which days so that no conflicts arise?
 E

Executive (E) = {a, b, c}

Finance (F) = {a, b, d} R
Social (S) = {e, f} F
Ways/Means (W) = {b, d, e}
By-Laws (B) = {a, c, g} B
Recruiting (R) = {c, e, f, g}
W S
Executive (E) = {a, b, c}
E
Finance (F) = {a, b, d}
Social (S) = {e, f}
Ways/Means (W) = {b, d, e} R
By-Laws (B) = {a, c, g} F
Recruiting (R) = {c, e, f, g}
Answer: The meetings can be B
scheduled in three days, such that:
Day 1: Executive & Social Com.
W S
Day 2: Finance & Recruiting Com.
Day 3: Ways/Means & By-Laws Com. Chromatic no. = 3
A school has six irregular graduating seniors:
Allen (A), Ben (B), Cory (C), Dan (D), Ella (E), and Fe (F).
You must prepare a special final exam schedule such
that each student can take the exam in all his/her
subjects in one day, but students with common
subjects can not be scheduled on the same day.
A: English, Science, Politics D: English, French, Art
B: Science, Politics, Philosophy E: Politics, Art, Philosophy
C: Math, Philosophy, Art F: Math, Science, Music
Construct a planar graph and using vertex coloring,
find the fewest number of days that the administration
of the special exams can be done. Suggest one
possible schedule.
A: English, Science, Politics D: English, French, Art
B: Science, Politics, Philosophy E: Politics, Art, Philosophy
C: Math, Philosophy, Art F: Math, Science, Music
A

F
B
E
D

C
A: English, Science, Politics D: English, French, Art
B: Science, Politics, Philosophy E: Politics, Art, Philosophy
C: Math, Philosophy, Art F: Math, Science, Music
A

F
B
E
D

Chromatic no. = 3
C
A: English, Science, Politics D: English, French, Art
B: Science, Politics, Philosophy E: Politics, Art, Philosophy
C: Math, Philosophy, Art F: Math, Science, Music

Answer: The special exam can be A

administered in three days with
the following suggested schedule F
of students: B
E
Day 1: Allen, Cory D
Day 2: Dan, Ben
Day 3: Ella, Fe C
Chromatic no. = 3