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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
