In this thesis we examine chromatic polynomials from the viewpoint of algebraic number theory. We relate algebraic properties of chromatic polynomials of graphs to structural properties of those graphs for some simple families of graphs. We then compute the Galois groups of chromatic polynomials of some sub-families of an infinite family of graphs (denoted {Gp,q }) and prove a conjecture posed in [15] concerning the Galois groups of one specific sub-family. Finally we investigate a conjecture due to Peter Cameron [8] that says that for any algebraic integer α there is some n ∈ ℕ such that α + n is the root of some chromatic polynomial. We prove the conjecture for quadratic and cubic integers and provide strong computational evidence that it is true for quartic and quintic integers.