 | 2009 |
|---|
| 21 |       | Lan Shen,
Yingqian Wang,
Wei-Fan Wang,
Ko-Wei Lih:
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles.
Appl. Math. Lett. 22(9): 1369-1373 (2009) |
| 2008 |
|---|
| 20 |  | Wei-Fan Wang,
Ko-Wei Lih:
Note on Coloring the Square of an Outerplanar Graph.
Ars Comb. 86: (2008) |
| 19 | | Wei-Fan Wang,
Ko-Wei Lih:
Coupled choosability of plane graphs.
Journal of Graph Theory 58(1): 27-44 (2008) |
| 2007 |
|---|
| 18 | | Wei-Fan Wang,
Ko-Wei Lih:
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability.
Eur. J. Comb. 28(1): 111-120 (2007) |
| 2006 |
|---|
| 17 | | Wei-Fan Wang:
The L(2, 1)-labelling of trees.
Discrete Applied Mathematics 154(3): 598-603 (2006) |
| 16 | | Wei-Fan Wang:
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers.
Discrete Mathematics 306(2): 262-270 (2006) |
| 2005 |
|---|
| 15 | | Wei-Fan Wang,
Ko-Wei Lih:
List Coloring Halin Graphs.
Ars Comb. 77: (2005) |
| 2004 |
|---|
| 14 | | Ko-Wei Lih,
Li-Da Tong,
Wei-Fan Wang:
The Linear 2-Arboricity of Outerplanar Graphs.
Ars Comb. 73: (2004) |
| 13 | | Wei-Fan Wang:
Vertex-pancyclicity of edge-face-total graphs.
Discrete Applied Mathematics 143(1-3): 364-367 (2004) |
| 12 | | Wei-Fan Wang,
Ko-Wei Lih:
The edge-face choosability of plane graphs.
Eur. J. Comb. 25(7): 935-948 (2004) |
| 2003 |
|---|
| 11 | | Chun-Yen Chou,
Wei-Fan Wang,
Xuding Zhu:
Relaxed game chromatic number of graphs.
Discrete Mathematics 262(1-3): 89-98 (2003) |
| 10 | | Ko-Wei Lih,
Wei-Fan Wang,
Xuding Zhu:
Coloring the square of a K4-minor free graph.
Discrete Mathematics 269(1-3): 303-309 (2003) |
| 9 | | Ko-Wei Lih,
Li-Da Tong,
Wei-Fan Wang:
The Linear 2-Arboricity of Planar Graphs.
Graphs and Combinatorics 19(2): 241-248 (2003) |
| 8 | | Wei-Fan Wang,
Ko-Wei Lih:
Labeling Planar Graphs with Conditions on Girth and Distance Two.
SIAM J. Discrete Math. 17(2): 264-275 (2003) |
| 2002 |
|---|
| 7 | | Wei-Fan Wang,
Ko-Wei Lih:
Choosability and edge choosability of planar graphs without five cycles.
Appl. Math. Lett. 15(5): 561-565 (2002) |
| 6 | | Ko-Wei Lih,
Zengmin Song,
Wei-Fan Wang,
Kemin Zhang:
Edge-pancyclicity of coupled graphs.
Discrete Applied Mathematics 119(3): 259-264 (2002) |
| 5 | | Wei-Fan 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) |
| 4 | | Wei-Fan Wang:
Equitable Total Coloring of Graphs with Maximum Degree 3.
Graphs and Combinatorics 18(3): 677-685 (2002) |
| 3 | | Wei-Fan Wang,
Ko-Wei Lih:
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles.
SIAM J. Discrete Math. 15(4): 538-545 (2002) |
| 2001 |
|---|
| 2 | | Ko-Wei Lih,
Zengmin Song,
Wei-Fan Wang,
Kemin Zhang:
A note on list improper coloring planar graphs.
Appl. Math. Lett. 14(3): 269-273 (2001) |
| 1 | | Wei-Fan Wang,
Ko-Wei Lih:
Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs.
Eur. J. Comb. 22(1): 71-78 (2001) |
