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. © 1994 Academic Press, Inc.
Cite
CITATION STYLE
APA
Thomassen, C. (1994). Every Planar Graph Is 5-Choosable. Journal of Combinatorial Theory, Series B, 62(1), 180–181. https://doi.org/10.1006/jctb.1994.1062
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free