- CSB - MetaPress - Google - Bing - Yahoo
 | 2010 | |
|---|---|---|
| j3 |      | Yingqian Wang, Huajing Lu, Ming Chen: Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. Discrete Mathematics 310(1): 147-158 (2010) |
| 2009 | ||
| j2 | | Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud: On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discrete Mathematics 309(13): 4596-4607 (2009) |
| 2008 | ||
| j1 | | Yingqian Wang, Huajing Lu, Ming Chen: A note on 3-choosability of planar graphs. Inf. Process. Lett. 105(5): 206-211 (2008) |
| 1 | Yuehua Bu | |
| 2 | Ming Chen | |
| 3 | Mickaël Montassier | |
| 4 | André Raspaud | |
| 5 | Wei-Fan Wang (Weifan Wang) | |
| 6 | Yingqian Wang |
Data released under the ODC-BY 1.0 license — See also our legal information page