A combinatorial graph is a collection of vertices and edges between them. A generating function is a tool used to keep track of combinotorial data. Using generating functions, we will discuss an unexpected relationship between counting certain types of graphs, vertex colorings and acyclic orientations. No prior knowledge of combinatorics will be assumed. This is joint work with Jeremy Martin and Bruce Sagan.