CYCLE – a sequence of consecutively linked edges
(x
(x
1
1
,x2),(x2,x3),…,(x
= x n n-1
,x n
) whose starting vertex is the ending vertex
) and in which no edge can appear more than once. No edge can appear more than once.
EULER CYCLE – a cycle that contains all the edges in a graph (and visits each vertex at least once).
TRAIL – a sequence of consecutively linked edges in which no edge can appear more than once.
MULTIGRAPHS – a graph which permits several edges joining the same pair of vertices.
a
Ex.
d c b

c i a n j d k e b h f
Euler cycle: a,d,c,i,j,n,o,k,j,d,e,k,l,h,m,g,h,f,e,b,a g
(a) l m o g c d e f h (b) m i j k l

1
EULER TRAIL – a trail that contains all the edges in a graph (and visits each vertex at least once).
DEADHEADING EDGE – edges added to a graph.
LINE GRAPH – The line graph L(G) of graph of G has a vertex for each edge of G,and two of these vertices are adjacent if and only if the corresponding edges in G have a common end vertex.
6
Ex.
2
5 3
3
2
1 5
6
L(G)
G

The Seven Bridges of Konigsberg
A
B
C
D
B
A
D
C

c i
An undirected multigraph has an Euler cycle if and only if it is connected and has all the vertices of even degree.
PROOF:
• Suppose a multigraph G satisfies the two given conditions.
• Pick any vertex a and trace out a trail.
• Let C by the cycle thus generated and let G’ be the multigraph consisting of the remaining edges G-C.
a j n d
(G) b f e h k l o
Red = cycle C m g i c d j e k
(G’) f l h g m

•Because the original path was connected, C and G’ must have a common vertex, call it a’.
• Build a new cycle C’ tracing through G’ from a’’ just as C was traced in G from a.
• Incorporate C’ into the cycle C at a’ to obtain a new and larger cycle C’.
• Repeat this process by tracing a cycle in the graph of G’’ of still remaining edges and incorporate the cycle into C’ to obtain C’’.
• Continue until no edges remain.
c
• It must next be shown that if a Euler cycle exists, then the graph is connected and has all vertices of even degree. ( another day.
) In the essence of time we will save this for a b f d e f g c d e g h h j k l m i l i j
Green = cycle C’
Blue = cycle C’’ k n o
G = C + C’ + C’’ m

A multigraph has an Euler trail, but not and Euler cycle, if and only if it is connected and has exactly two vertices of odd degree.
PROOF:
• Suppose a multigraph has an Euler trail T, but not an Euler cycle.
• The starting and ending vertices of T must have odd degree while all other vertices have an even degree. Also the graph must be connected.
Ex
.

• Suppose on the other hand that a multigraph G is connected and has exactly two vertices, p and q, of odd degree.
• Add a supplementary edge (p,q) to G to obtain a graph G’.
p q
• G’ now has all vertices of even degree and therefore has an Euler cycle
(Euler cycle theorem).
• Remove the edge (p,q) from C.
• Without this edge C the Euler cycle is reduced to an Euler trail that includes all of edges of G. Hence the corollary.

K2
K3
K4
K5
K6
K8
K2: Euler trail – Yes
Euler cycle – No
K3: Euler trail – No
Euler cycle – Yes
K4: Euler trail – No
Euler cycle – No
K5: Euler trail – No
Euler cycle – Yes
.
K6: Euler trail – No
Euler cycle – No
.
.
K8: Euler trail – No
Euler cycle – No

1.
A) Can a graph with an Euler cycle have a bridge (an edge whose removal disconnects the graph)?
B) Give an example of a 10-edge graph with an Euler trail that has a bridge.
Answers:
A) No. If you start on one side of the bridge and then you cross it the only way you can get back to where you started is to cross the bridge again. This means you have to travel the same edge twice and thus, a Euler cycle cannot exist.
B)

2. Find a minimal set of edges in the graph below whose removal produces an Euler cycle.
All vertices are of even degree but we cannot find the Euler cycle.
a f e b j g i h c d