| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 2001 | A note on list improper coloring planar graphs | Lih, Ko-Wei; Lih, Ko-Wei; Song, Zengmin; Wang, Weifan; Zhang, Kemin | Applied Mathematics Letters 14(3), 269-273 | | | |
| 2002 | Choosability and edge choosability of planar graphs without five-cycles | Wang, Weifan; Lih, Ko-Wei | Applied Mathematics Letters 15(5), 561-565 | | | |
| 2002 | Choosability and edge choosability of plane graphs without intersecting triangles | Wang, Weifan; Lih, Ko-Wei | SIAM Journal on Discrete Mathematics 15(4), 538-545 | | | |
| 2001 | Choosability, edge choosability, and total choosability of outerplane graphs | Wang, Weifan; Lih, Ko-Wei | European Journal of Combinatorics 22(1), 71-78 | | | |
| 2002 | Edge-pancyclicity of coupled graphs | Lih, Ko-Wei; Song, Zengmin; Wang, Weifan; Zhang, Kemin | Discrete Applied Mathematics 119(3), 259-264 | | | |
| 2002 | Edge-partitions of planar graphs and their game coloring numbers | He, Wenjie; Hou, Xiaoling; Lih, Ko-Wei; Shao, Jiating; Wang, Weifan; Zhu, Xuding | Journal of Graph Theory 41(4), 307-317 | | | |
| 2013 | Full orientability of the square of a cycle | Lih, Ko-Wei; Xu, Fengwei; Wang, Weifan | Ars Combinatoria | | | |
| 2004 | Labeling planar graphs with conditions on girth and distance two | Wang, Weifan; Lih, Ko-Wei | SIAM Journal on Discrete Mathematics 17(2), 264-275 | | | |
| 2009 | On (d,1)-total number of graphs | Lih, Ko-Wei; Liu, Daphne Der-Fen; Wang, Weifan | Discrete Mathematics 309(12), 3767-3773 | | | |
| 2009 | On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles | Shen, Lan; Wang, Yingqian; Wang, Weifan; Lih, Ko-Wei | Applied Mathematics Letters 22(9), 1369-1373 | | | |
| 2020 | Plane graphs of maximum degree Δ ≥ 7 are edge‐face (Δ + 1)‐colorable | Wang, Yiqiao; Hu, Xiaoxue; Wang, Weifan; Lih, Ko‐Wei | Journal of Graph Theory 95(1), 99-124 | | | |
| 2001 | Structural properties and edge choosability of plane graphs without 6-cycles | Wang, Weifan; Ko-Wei Lih | Combinatorics, Probability and Computing 10(3), 267-276 | | | |
| 2001 | The 4-choosability of planar graphs without 6-cycles | Wang, Weifan; Lih, Ko-Wei | Australasian Journal of Combinatorics 24, 157-164 | | | |
| 2011 | The minimum number of dependent arcs in $C^{3}_{3k}$ | Xu, Fengwei; Wang, Weifan; Lih, Ko-Wei | Tamsui Oxford Journal of Information and Mathematical Sciences 27(4), 37-50 | | | |
| 2002 | The Whitney's triangulations of plane graphs | Lih, Ko-Wei; Wang, Weifan | Bulletin of the Institute of Combinatorics and Its Applications 34, 55-57 | | | |
