ThesisRobinson, GrantLet $D$ be a fixed set of prime numbers. In this thesis we investigate the chromatic number of graphs with vertex set of the integers and edges between any pair of vertices whose distance is in $D$. Such a graph is called a prime distance graph, and t . . .