Graph choosability and double list colorability
Loading...
Files
Date
Presentation Date
Editor
Authors
Other contributors
Other title
Resource type
Version
wersja wydawnicza
Pagination/Pages:
pp. 271-276
Research Project
Description
Keywords
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.