Logic and Discrete Mathematics

Section 7.5
Eulerian Graphs and Hamiltonian Graphs

Slides version: January 2015

 The Bridges of Königsberg and Euler

Leonhard Euler,
1707 – 1783
The bridges of Königsberg
The Bridges of Königsberg as a multigraph

A B

D
 Eulerian trails and circuits

Definition
An Eulerian trial of a graph G is an open trial of G containing all
the edges and vertices of G.
 Eulerian trails and circuits

Definition
An Eulerian trial of a graph G is an open trial of G containing all
the edges and vertices of G.
An Eulerian circuit of G is a circuit containing all the edges and
vertices of G. A graph that has an Eulerian circuit is called an
Eulerian graph.
 Example: Eulerian circuits and trails (1)

Does the following graph have an Eulerian circuit or an Eulerian

trail?
c

d b

e a
 Example: Eulerian circuits and trails (2)

Does the following graph have an Eulerian circuit or an Eulerian

trail?
f
a d
c
g

b e
h
 Characterization of Eulerian Graphs and Trails

Theorem
Let G be a nontrivial connected graph. Then G is Eulerian if
and only if every vertex of G is even.
 Characterization of Eulerian Graphs and Trails

Theorem
Let G be a nontrivial connected graph. Then G is Eulerian if
and only if every vertex of G is even.

Theorem
Let G be a nontrivial connected graph. Then G contains an
Eulerian trail if and only if G has exactly two vertices of odd
degree. Furthermore, the trail trail begins at one of these odd
vertices and terminates at the other.
 Eulerian digraphs

Definition
Let D be a digraph.
A directed Eulerian trail of D is a directed open trail containing
all the vertices and arcs of D.
 Eulerian digraphs

Definition
Let D be a digraph.
A directed Eulerian trail of D is a directed open trail containing
all the vertices and arcs of D.
A directed Eulerian circuit of D is a directed circuit containing all
the vertices and arcs of D.
 Eulerian digraphs

Definition
Let D be a digraph.
A directed Eulerian trail of D is a directed open trail containing
all the vertices and arcs of D.
A directed Eulerian circuit of D is a directed circuit containing all
the vertices and arcs of D.
A digraph that contains an directed Eulerian circuit is called an
Eulerian digraph.
 Eulerian digraphs

Definition
Let D be a digraph.
A directed Eulerian trail of D is a directed open trail containing
all the vertices and arcs of D.
A directed Eulerian circuit of D is a directed circuit containing all
the vertices and arcs of D.
A digraph that contains an directed Eulerian circuit is called an
Eulerian digraph.

Theorem
Let D be a nontrivial connected digraph. Then D is Eulerian if
and only if the indegree of every vertex is equal to its
outdegree.
 Example: Directed Eulerian circuits and trails

Does the following digraph have a directed Eulerian circuit or

an Eulerian trail?

a b

d c
 Hamiltonian Graphs

Sir William Rowan

Hamilton (1805 – 1865)

Definition
A path containing every vertex of G is called a Hamiltonian path
in G.
 Hamiltonian Graphs

Sir William Rowan

Hamilton (1805 – 1865)

Definition
A path containing every vertex of G is called a Hamiltonian path
in G.
A cycle in G containing every vertex of G is called a
Hamiltonian cycle in G.
 Hamiltonian Graphs

Sir William Rowan

Hamilton (1805 – 1865)

Definition
A path containing every vertex of G is called a Hamiltonian path
in G.
A cycle in G containing every vertex of G is called a
Hamiltonian cycle in G.
A graph having a Hamiltonian cycle is called a Hamiltonian
graph.
 Hamiltonian Graphs: Examples(1)

The graph of the Dodecahedron has a Hamiltonian cycle.

 Hamiltonian Graphs: Examples(2)

• Every complete graph of order 3 or greater is Hamiltonian.

 Hamiltonian Graphs: Examples(2)

• Every complete graph of order 3 or greater is Hamiltonian.

• The Petersen Graph is has a Hamiltonian path, but no
Hamiltonian cycle.
 Hamiltonian Graphs: Examples(2)

• Every complete graph of order 3 or greater is Hamiltonian.

• The Petersen Graph is has a Hamiltonian path, but no
Hamiltonian cycle.
• K3,3 is Hamiltonian.
 Hamiltonian Graphs: Examples(2)

• Every complete graph of order 3 or greater is Hamiltonian.

• The Petersen Graph is has a Hamiltonian path, but no
Hamiltonian cycle.
• K3,3 is Hamiltonian.
• K3,2 has a Hamiltonian path, but no Hamiltonian cycle.
 Hamiltonian Graphs: Examples(2)

• Every complete graph of order 3 or greater is Hamiltonian.

• The Petersen Graph is has a Hamiltonian path, but no
Hamiltonian cycle.
• K3,3 is Hamiltonian.
• K3,2 has a Hamiltonian path, but no Hamiltonian cycle.
• K1,3 has neither a Hamiltonian path nor a Hamiltonian
cycle.
 Ore’s Theorem

Theorem
Let G be an (n, m)-graph with n ≥ 3. If

deg u + deg v ≥ n,

for all distinct nonadjacent vertices u and v of G, then G is

Hamiltonian.