The SCEAS System
| |||||||

## Search the dblp DataBase
Wei-Fan Wang:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Ko-Wei Lih, Zengmin Song, Weifan Wang, Kemin Zhang
**A note on list improper coloring planar graphs.**[Citation Graph (0, 0)][DBLP] Appl. Math. Lett., 2001, v:14, n:3, pp:269-273 [Journal] - Weifan Wang, Ko-Wei Lih
**Choosability and edge choosability of planar graphs without five cycles.**[Citation Graph (0, 0)][DBLP] Appl. Math. Lett., 2002, v:15, n:5, pp:561-565 [Journal] - Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang
**The Linear 2-Arboricity of Outerplanar Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2004, v:73, n:, pp:- [Journal] - Wei-Fan Wang, Ko-Wei Lih
**List Coloring Halin Graphs.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2005, v:77, n:, pp:- [Journal] - Ko-Wei Lih, Zengmin Song, Weifan Wang, Kemin Zhang
**Edge-pancyclicity of coupled graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:119, n:3, pp:259-264 [Journal] - Wei-Fan Wang
**Vertex-pancyclicity of edge-face-total graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2004, v:143, n:1-3, pp:364-367 [Journal] - Wei-Fan Wang
**The**[Citation Graph (0, 0)][DBLP]*L*(2, 1)-labelling of trees. Discrete Applied Mathematics, 2006, v:154, n:3, pp:598-603 [Journal] - Chun-yen Chou, Wei-Fan Wang, Xuding Zhu
**Relaxed game chromatic number of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:262, n:1-3, pp:89-98 [Journal] - Ko-Wei Lih, Wei-Fan Wang, Xuding Zhu
**Coloring the square of a**[Citation Graph (0, 0)][DBLP]*K*_{4}-minor free graph. Discrete Mathematics, 2003, v:269, n:1-3, pp:303-309 [Journal] - 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] - Weifan Wang, Ko-Wei Lih
**Choosability, Edge Choosability, and Total Choosability of Outerplane Graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2001, v:22, n:1, pp:71-78 [Journal] - Wei-Fan Wang, Ko-Wei Lih
**The edge-face choosability of plane graphs.**[Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2004, v:25, n:7, pp:935-948 [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] - Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang
**The Linear 2-Arboricity of Planar Graphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2003, v:19, n:2, pp:241-248 [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]**On (d, 1)-total numbers of graphs.**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |