  To each colored graph, one can associate its closure in the universal space
of isomorphism classes of pointed colored graphs, and this subspace can be
regarded as a generalized subshift. Based on this correspondence, we extend the
notion of chaotic dynamical systems to colored graphs. We introduce definitions
for chaotic and almost chaotic (colored) graphs, and prove their topological
genericity in various subsets of the universal space.
