Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable

Autor:	Wang, Yingqian, Lu, Huajing, Chen, Ming
Zdroj:	In Discrete Mathematics 2010 310(1):147-158
Databáze:	ScienceDirect
Externí odkaz:	Zobrazit plný text záznamu Full Text from ScienceDirect