In this paper we establish the cover time of a random graph chosen uniformly at random from the set of graphs with vertex set and degree sequence d. We show that under certain restrictions on d, the cover time of is whp asymptotic to . Here is the average degree and is the effective minimum degree.