Wei-Fan Wang Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:2, pp:262-270 [Journal]
Weifan Wang, Ko-Wei Lih A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:253, n:1-3, pp:87-95 [Journal]
Wei-Fan Wang, Ko-Wei Lih On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2007, v:28, n:1, pp:111-120 [Journal]
Wei-Fan Wang Equitable Total Coloring of Graphs with Maximum Degree 3. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:3, pp:677-685 [Journal]
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. [Citation Graph (, )][DBLP]
Note on Coloring the Square of an Outerplanar Graph. [Citation Graph (, )][DBLP]