List coloring

List coloring is a concept in graph theory related to the coloring of graphs. In a standard graph coloring problem, the goal is to assign colors to the vertices of a graph such that no two adjacent vertices share the same color, using a given number of colors. In list coloring, the situation is slightly more specialized. Each vertex of the graph is associated with a specific list of allowable colors.