Graph coloring is an assignment of integers to the vertices of a graph so that no two adjacent vertices are assigned the same number. A list coloring of a graph is an assignment of integers to the vertices of a graph with the restriction that the integers must come from specifi c lists of available colors at each vertex. This paper presents a survey of last three decades of research in the fi eld of colorings. Also, the goal of this survey is to show the path to mathematicians to bring new innovative ideas in the subject of list colorings. © International Science Press.