Coloração de lista: um survey sobre novos resultados

Abstract

Let G = (V,E) be a graph, G has proper coloring in your vertices, case adjacents vertex have distincts colors. A list coloring of the graph G denoted as L(G) is a proper coloring in the G vertex such that each vertex has a list of colors available to color. Over the years, results have emerged, many of them have List Coloring as subject. In this paper we present a survey where we organize recent researchs in the field of Coloring List, which ones are directly and indirectly related to List Coloring.