TY  - JOUR
ID  - Fanaï2010
LB  - Fanaï2010
AU  - Fanaï, Hamid-Reza
TI  - Graph choosability and double list colorability
ST  - Graph choosability and double list colorability
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2010
VL  - 30
IS  - 3
SP  - 271
EP  - 276
DO  - http://dx.doi.org/10.7494/OpMath.2010.30.3.271
UR  - http://dx.doi.org/10.7494/OpMath.2010.30.3.271
AB  - 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.
KW  - list coloring
KW  - choosability
SN  - 1232-9274
ER  -