22/11/2018

Mathematics as a Tool
The Mathematics of Graphs 05
(Graph Coloring)
Francis Guthrie
1831-1899

https://en.wikipedia.org/wiki/Francis_Guthrie

Suppose you want to color a map so that any two areas

that share a boundary should not be of the same color.
Same problem using a different perspective
What is the least number of colors you can use?

B M
E P R
C J U
D
A L
G N S

F K Q
H
O T

Maps can be converted to graphs.

Note how graphs from maps are always planar.

Same problem using a different perspective DEFINITION

• If n colors can be used to color the vertices of a graph such that
B M adjacent vertices have different colors, we say that the graph is
E P R n-colorable. The smallest number of colors needed to carry out this
J
C
D U vertex coloring is called the chromatic number of the graph.*
A L
G N S
Is this graph 5-colorable?
F K Q
H Is this graph 4-colorable?
O T Is this graph 3-colorable?
Is this graph 2-colorable?
Assign a color to each vertex of the graph such that no two vertices that share What is the chromatic number of this graph?
an edge are the same. What is the least number of colors you can use?
* The same terms are used when referring to equivalent map coloring situations.
 22/11/2018

EXERCISES Significant Theorems

• Find the chromatic number of the following graphs. FOUR-COLOR THEOREM
• Every planar graph is 4-colorable.*

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.

* Thus, any planar map is 4-colorable.

Applications Applications
Six student clubs need to hold meetings on the same day, but some students Six film students collaborated on the creation of five films.
belong to more than one club. To avoid members missing meetings, the
meetings need to be scheduled during different time slots. An “X” in the • Film A – produced by Brian, Chris, Damon
table below indicates that two corresponding clubs share at least one • Film B – produced by Allison, Fernando
member. Use graph coloring to determine the minimum number of time • Film C – produced by Damon, Erin, Fernando
slots necessary to ensure that all club members can attend all meetings. • Film D – produced by Brian, Erin
• Film E – produced by Brian, Chris, Erin
Kythe MEA AMS BlueRep Tugon LM
Kythe - X X The college is scheduling a one-day film festival where each film will be
MEA - X X X shown once and the producers of each film will attend and participate in a
AMS X X - X discussion afterward. The college has several screening rooms available and
BlueRep X - X X
two hours will be allotted for each film. If the showings begin at noon, create
a screening schedule that allows the festival to end as early as possible while
Tugon X X X - assuring that all of the producers of each film can attend that film’s
LM X X - screening.

Applications
A researcher has discovered six new species of insects overseas and needs to
transport them home. Some species will harm each other and so cannot be
transported in the same container.
• Species A cannot be housed with species C or F.
• Species B cannot be housed with species D or F.
• Species C cannot be housed with species A, D, or E.
• Species D cannot be housed with species B, C, or F.
• Species E cannot be housed with species C or F.
• Species F cannot be housed with species A, B, D, or E.
Draw a graph where each vertex represents a species of insect and an edge
connects two vertices if the species cannot be housed together. Then use
graph coloring to determine the minimum number of containers the
researcher will need to transport the insects.

Textbook exercises you can work on

independently: Exercise Set 6.4, pp. 277-280