Graph choosability and double list colorability
Hamid-Reza Fanaı̈ · Opuscula Mathematica · 2010
In this paper, we give a sufficient condition for graph choosability, based on Combinatorial Nullstellensatz and a specific property, called "double list colorability", which means that there is a list assignment for which there are exactly two admissible colorings.