diff --git a/chapter19.tex b/chapter19.tex
index 8e27242..6b00034 100644
--- a/chapter19.tex
+++ b/chapter19.tex
@@ -546,7 +546,7 @@ combinations of three bits:
 000, 001, 010, 011, 100, 101, 110 and 111.
 
 It turns out that each De Bruijn sequence
-corresponds to an Eulerian circuit in a graph.
+corresponds to an Eulerian path in a graph.
 The idea is to construct the graph so that
 each node contains a combination of $n-1$ characters
 and each edge adds one character to the string.