  We introduce the Euclid-Mullin graph, which encodes all instances of Euclid's
proof of the infinitude of primes. We investigate structural properties of the
graph both theoretically and numerically; in particular, we prove that it is
not a tree.
