| 2008 |
|---|
| 5 | EE | Yingqian Wang,
Ming Chen,
Liang Shen:
Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable.
Discrete Mathematics 308(17): 4014-4017 (2008) |
| 4 | EE | Yongzhu Chen,
Yingqian Wang:
On the diameter of generalized Kneser graphs.
Discrete Mathematics 308(18): 4276-4279 (2008) |
| 3 | EE | Yingqian Wang,
Huajing Lu,
Ming Chen:
A note on 3-choosability of planar graphs.
Inf. Process. Lett. 105(5): 206-211 (2008) |
| 2 | EE | Mickaël Montassier,
André Raspaud,
Weifan Wang,
Yingqian Wang:
A relaxation of Havel's 3-color problem.
Inf. Process. Lett. 107(3-4): 107-109 (2008) |
| 2007 |
|---|
| 1 | EE | Liang Shen,
Yingqian Wang:
A sufficient condition for a planar graph to be 3-choosable.
Inf. Process. Lett. 104(4): 146-151 (2007) |
