| | |
@article{DBLP:journals/dm/Gutner96,
author = {Shai Gutner},
title = {The complexity of planar graph choosability},
journal = {Discrete Mathematics},
volume = {159},
number = {1-3},
year = {1996},
pages = {119-130},
ee = {http://dx.doi.org/10.1016/0012-365X(95)00104-5},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Last update 2008-11-24 CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page