L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |1

Module 8:

Hamiltonian Paths and Circuits

INTENDED LEARNING OUTCOME

At the end of the lesson, the students can:

A. Identify whether a graph has a Hamiltonian circuit or path

B. Find the optimal Hamiltonian circuit for a graph using the greedy algorithm, and the edge-
picking algorithm
C. Apply graph coloring on scheduling meetings and events related problem.

ENGAGE

The table below lists down the distances (miles) between the cities having direct routes as well as the
corresponding distances between them. Draw a graph the represents this information
 L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |2

EXPLORE

1. Can you find two different routes that visit each of the places and return to its starting point without
visiting any city twice?

2. What is the shortest routes from Manila to Davao?

3. What is the shortest route from Palawan to Davao?

EXPLAIN

In Euler circuits, closed paths use every edge exactly once, possibly visiting a vertex more than once. On
the contrary, in Hamiltonian circuits, paths visit each vertex exactly once, possibly not passing through some of
the edges.

Hamiltonian Path
A Hamiltonian path is a path that visits each vertex of the graph exactly once.

Hamiltonian Circuit
A Hamiltonian Circuit is a path user each vertex of a graph exactly once and returns
to the starting vertex. A graph that contains a Hamiltonian circuit is called Hamiltonian

Hamiltonian circuits are named for William Rowan Hamilton who studied them in the
1800’s.

Unlike with Euler circuits, there is no nice theorem that allows us to instantly determine whether or not
a Hamiltonian circuit exists for all graphs

Example:
One Hamiltonian circuit is shown on the graph below. There are several other Hamiltonian circuits
possible on this graph. Notice that the circuit only has to visit every vertex once; it does not need to use every
edge.

This circuit could be notated by the sequence of vertices visited, starting and ending at the same vertex:
ABFGCDHMLKJEA. Notice that the same circuit could be written in reverse order, or starting and ending at a
different vertex. ( notice we did not use the edge connecting BC and the edge connecting GH)
 L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |3

Hamiltonian Circuit: ABFGCDHMLKJEA

Does a Hamiltonian path or circuit exist on the graph below?

We can see that once we travel to vertex E there is no way to leave without returning to C, so there is no
possibility of a Hamiltonian circuit. If we start at vertex E we can find several Hamiltonian paths, such as ECDAB
and ECABD.

Weighted Graph
A weighted graph is a graph in which each edge is associated with a value,
called weight.

The Greedy Algorithm ( Nearest Neighbor Algorithm)

A method of finding a Hamiltonian circuit in a complete weighted graph is given by the
following greedy algorithm.
1.Choose a vertex to start at, then travel along the connected edge that has the smallest
weight. 2.After arriving at the next vertex, travel along the edge of smallest weight that connects to a
 L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |4

Example:

Consider the graph and apply the greedy algorithm starting at vertex A.
 Starting at vertex A, the nearest neighbor is vertex D with a weight of 1.
 From D, the nearest neighbor is C, with a weight of 8.
 From C, the only option is B, which is the only unvisited vertex, with a weight of 13.
 From B, return to A with a weight of 4.
 The resulting circuit is ADCBA, with a total weight of 1+8+13+4 = 26.

However, the resulting circuit above does not have the minimal total weight. The Hamiltonian circuit ACDBA has
the total weight of 2 + 8 + 9 + 4 = 23

The Edge Picking Algorithm (Sorted Edges Algorthm)

Another method of finding a Hamiltonian circuit in a complete weighted graph is given by the
following edge-picking algorithm.
1.Mark the edge of smallest weight in the graph.
2.Mark the edge of the next smallest weight in the graph, as long as it does not complete a
circuit and does not add a third marked edge to a single vertex.
3.Continue the process until you can no longer mark any edges. Then mark the final edge that
completes the Hamiltonian circuit.

Example:
 L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |5

Consider the graph below and apply the Edge Picking Algorithm.

REMEMBER:
The edge-picking algorithm attempts to give a circuit of minimal total weight, although it does not
always succeed.

Planar graph

A planar graph is a graph that can be drawn so that no edges intersect each other
(except at vertices).
 L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |6

GRAPH COLORING

There is a connection between map coloring and graph theory. Maps can be modeled by graphs using
the countries as the vertices and two vertices (countries) are adjacent if they share a common boundary. In
graph coloring, each vertex of a graph will be assigned one color in such away that no two adjacent vertices have
the same color. The interesting idea here is to determine the minimum number of (distinct) colors to be used so
that we can color each vertex of a graph with no two adjacent vertices have the same color

The minimum number of colors needed to color a graph so that no edge connects vertices of the same
color is called the chromatic number.

Four-Color Theorem
The chromatic number of a planar graph is utmost 4

Two Colorable Graph Theorem

A graph is 2-colorable if and only if it has no circuits that consist of an odd number of vertices.

ELABORATE
 L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |7

Let us answer the given problems below

1.) Aaron, Belle, Carol, Donna, Eric, and Fe are best of friends. The figure below shows the distances (km)
from a friend’s place to another. If Aaron wants to visit each of his friends’ houses exactly once, what is the
shortest route that he must take? Use the Greedy and edge picking algorithms.

Solution using the Edge-Picking Algorithm

 First we mark the line segment from Aaron’s house to Belle’s house, of weight 1.
 L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |8

 Next we mark the segment from Belle’s to Carol’s house, of weight 2, followed by Carol’s to
Donna’s house, of weight 3, followed by Eric’s to Fe’s house, of weight 6.
 Take note that we cannot mark the segment from Eric’s house to Aaron’s because it can
complete a circuit. Also, we cannot mark the segment from Carol’s to Fe’s house because it can
make the third marked edge on a vertex.
 Finally to complete the circuit, we mark the line segment from Fe’s house back to Aaron’s.
 The final Hamiltonian circuit, of total weight 1+2+3+6+9+12=33, is Aaron’s house – Belle’s house
– Carol’s house – Donna’s house – Eric’s house – Fe’s house and back to Aaron’s.

2. ) Six college accreditation committees need to hold meetings on the same day, but some teachers
belong to more than one committee. In order to avoid members missing meetings, the meetings need to be
scheduled during different time slots.
An “X” in the table indicates that the two corresponding committees share at least one member. Use
graph coloring to determine the minimum number of time slots necessary to ensure that all faculty members
can attend all meetings.
 L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |9

SOLUTION:
First we draw a graph representing the six committees using six vertices in any configuration. An edge connects
two committees that share at least one member. Then assign each vertex of the graph with one color in such a
way that no two adjacent vertices have the same color.

Therefore, minimum number of time slots necessary to ensure that all faculty members can attend all
meetings is 3.
Schedule of Meetings
First time slot: Faculty Instruction, Student Welfare
Second time slot: Faculty Development, Outreach Program
Third time slot: Library Facility, Physical Facility

EVALUATE

Answer the following:

1.) The table shows the

lengths of cables needed to
connect computers to create
 L E A R N I N G M O D U L E : M a t h e m a t i c s i n t h e M o d e r n W o r l d |10

a network. Find the minimum length of cable material needed using the edge-picking algorithm and the Greedy
algorithm.

16
15

2. ) Six exams are to be given to the students on the same day . But some students need to take the exam to
more than one subject. In order to avoid conflict, the exams need to be scheduled during different time slots. An
“X” in the table indicates that the two corresponding subjects share at least one member. Use graph coloring to
determine the minimum number of time slots necessary to ensure that students will not have a conflict in their
schedule of examination.
EXAMS ENGLISH SCIENCE MATH FILIPINO SOCIAL P.E
STUDIES

ENGLISH X X X X

SCIENCE X X X

MATH X X X X

FILIPINO X X X X

SOCIAL X X X
STUDIES

P.E X X X X

REFERENCES

Mathematics in the Modern World (2018), Rex Book Store Inc.

https://courses.lumenlearning.com/wmopen-mathforliberalarts/chapter/introduction-graph-theory/