Opuscula Math. 30, no. 3 (2010), 271-276
Graph choosability and double list colorability
Abstract. 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.
Keywords: list coloring, choosability.
Mathematics Subject Classification: 05C15, 05C31.
- Received: 2009-04-22.
- Revised: 2010-01-10.
- Accepted: 2010-03-04.