Every Planar Graph Is 5-Choosable
Every Planar Graph Is 5-Choosable
复制标题
DOI：
10.1006/jctb.1994.1062
复制
发表时间：
1994-09
期刊：
影响因子：
--
通讯作者：
C. Thomassen
中科院分区：
文献类型：
--
作者：
C. Thomassen
本文证明了V.G. 1979年，P.Erdos，A. L.鲁宾和H泰勒。
We prove the statement of the title, which was conjectured in 1975 by V. G. Vizing and, independently, in 1979 by P. Erdos, A. L. Rubin, and H Taylor.