| 2007 |
|---|
| 20 | EE | Dong Chen,
Weifan Wang:
(2, 1)-Total labelling of outerplanar graphs.
Discrete Applied Mathematics 155(18): 2585-2593 (2007) |
| 19 | EE | Weifan Wang,
Min Chen:
On 3-colorable planar graphs without prescribed cycles.
Discrete Mathematics 307(22): 2820-2825 (2007) |
| 18 | EE | Min Chen,
André Raspaud,
Weifan Wang:
Three-coloring planar graphs without short cycles.
Inf. Process. Lett. 101(3): 134-138 (2007) |
| 17 | EE | Xiaofang Luo,
Min Chen,
Weifan Wang:
On 3-colorable planar graphs without cycles of four lengths.
Inf. Process. Lett. 103(4): 150-156 (2007) |
| 16 | EE | Weifan Wang:
Total chromatic number of planar graphs with maximum degree ten.
Journal of Graph Theory 54(2): 91-102 (2007) |
| 15 | EE | Mickaël Montassier,
André Raspaud,
Weifan Wang:
Acyclic 5-choosability of planar graphs without small cycles.
Journal of Graph Theory 54(3): 245-260 (2007) |
| 14 | EE | Weifan Wang,
Yongzhu Chen:
A sufficient condition for a planar graph to be class 1.
Theor. Comput. Sci. 385(1-3): 71-77 (2007) |
| 2006 |
|---|
| 13 | EE | Yuehua Bu,
Weifan Wang:
Some sufficient conditions for a planar graph of maximum degree six to be Class 1.
Discrete Mathematics 306(13): 1440-1445 (2006) |
| 12 | EE | Mickaël Montassier,
André Raspaud,
Weifan Wang:
Bordeaux 3-color conjecture and 3-choosability.
Discrete Mathematics 306(6): 573-579 (2006) |
| 11 | EE | Weifan Wang,
Yiqiao Wang:
L(p, q)-labelling of K4-minor free graphs.
Inf. Process. Lett. 98(5): 169-173 (2006) |
| 10 | EE | Min Chen,
Weifan Wang:
The 2-dipath chromatic number of Halin graphs.
Inf. Process. Lett. 99(2): 47-53 (2006) |
| 2003 |
|---|
| 9 | EE | Weifan Wang,
Ko-Wei Lih:
Labeling Planar Graphs with Conditions on Girth and Distance Two.
SIAM J. Discrete Math. 17(2): 264-275 (2003) |
| 2002 |
|---|
| 8 | EE | Weifan Wang,
Ko-Wei Lih:
Choosability and edge choosability of planar graphs without five cycles.
Appl. Math. Lett. 15(5): 561-565 (2002) |
| 7 | | Ko-Wei Lih,
Zengmin Song,
Weifan Wang,
Kemin Zhang:
Edge-pancyclicity of coupled graphs.
Discrete Applied Mathematics 119(3): 259-264 (2002) |
| 6 | EE | Weifan Wang,
Ko-Wei Lih:
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs.
Discrete Mathematics 253(1-3): 87-95 (2002) |
| 5 | EE | Weifan Wang,
Ko-Wei Lih:
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles.
SIAM J. Discrete Math. 15(4): 538-545 (2002) |
| 2001 |
|---|
| 4 | EE | Ko-Wei Lih,
Zengmin Song,
Weifan Wang,
Kemin Zhang:
A note on list improper coloring planar graphs.
Appl. Math. Lett. 14(3): 269-273 (2001) |
| 3 | EE | Weifan Wang,
Ko-Wei Lih:
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs.
Eur. J. Comb. 22(1): 71-78 (2001) |
| 1999 |
|---|
| 2 | EE | Weifan Wang:
Upper Bounds of Entire Chromatic Number of Plane Graphs.
Eur. J. Comb. 20(4): 313-315 (1999) |
| 1995 |
|---|
| 1 | EE | Weifan Wang:
On the colorings of outerplanar graphs.
Discrete Mathematics 147(1-3): 257-269 (1995) |
