%0 Journal Article %1 thomassen94 %A Thomassen, Carsten %D 1994 %J Journal of Combinatorial Theory, Series B %K graph.theory list-coloring planar %N 1 %P 180 - 181 %R 10.1006/jctb.1994.1062 %T Every Planar Graph Is 5-Choosable %V 62 %X We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdös, A. L. Rubin, and H Taylor.

@article{thomassen94, abstract = {We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdös, A. L. Rubin, and H Taylor. }, added-at = {2015-05-28T10:33:25.000+0200}, author = {Thomassen, Carsten}, biburl = {https://www.bibsonomy.org/bibtex/2b9aa8f8eb198b5294928a9f582583597/ytyoun}, doi = {10.1006/jctb.1994.1062}, interhash = {88f46278c81945ffbeb78db550c29d6b}, intrahash = {b9aa8f8eb198b5294928a9f582583597}, issn = {0095-8956}, journal = {Journal of Combinatorial Theory, Series B }, keywords = {graph.theory list-coloring planar}, number = 1, pages = {180 - 181}, timestamp = {2015-05-28T10:44:36.000+0200}, title = {Every Planar Graph Is 5-Choosable }, volume = 62, year = 1994 }