A matrix approach to list coloring problems

This paper investigates the list coloring problem, and presents a number of new results and algorithms. By using the matrix semi-tensor product, the list coloring problem is studied, and three necessary and sufficient conditions are proposed, based on which an algorithm is designed to find all the list coloring schemes for any simple graph. In addition, the effectiveness of the results/algorithms presented in this paper is shown by one illustrative example.