| Issue Date | Title | Author(s) | Relation | scopus | WOS | Fulltext/Archive link |
| 2008 | 92.80 The edge-choosability of the tetrahedron | Cariolaro, David; Lih, Ko-Wei | Mathematical Gazette 92(525), 543-546 | | | |
| 1982 | A convexity inequality on the permanent of doubly stochastic matrices | Lih, Ko-Wei ; Lih, Ko-Wei; Wang, E. T. H. | Congressus Numerantium 36, 189-198 | | | |
| 2002 | A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs | Lih, Ko-Wei ; Weifan, Wang; Lih, Ko-Wei | Discrete Mathematics 253(1-3), 87-95 | | | |
| 2001 | A note on list improper coloring planar graphs | Lih, Ko-Wei ; Song, Zengmin; Wang, Weifan; Zhang, Kemin | Applied Mathematics Letters 14(3), 269-273 | | | |
| 2019 | A note on m-near-factor-critical graphs | Huang, Kuo-Ching; Lih, Ko-Wei | European Journal of Combinatorics 80, 273-276 | | | |
| 1993 | A note on the m-bounded chromatic number of a tree | Bor-Liang Chen; Ko-Wei Lih | European Journal of Combinatorics 14(4), 311-312 | | | |
| 2010 | A remarkable Euler square before Euler | Lih, Ko-Wei | Mathematics Magazine 83(3), 163-167 | | | |
| 2013 | Acyclic list edge coloring of graphs | Lih, Ko-Wei ; Lai, Hsin-Hao | Journal of Graph Theory 72(3), 247-266 | | | |
| 2010 | Acyclic list edge coloring of planar graphs | Lih, Ko-Wei ; Lai, Hsin-Hao | Bulletin of the Institute of Mathematics, Academia Sinica (New Series) 5(4), 413-436 | | | |
| 2011 | Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six | Yuehua Bu; Lih, Ko-Wei ; Weifan Wang | Discussiones Mathematicae Graph Theory31(3), 429-439 | | | |
| 2001 | An improvement on a spernerity proof of Horrocks | Szu-En Cheng; Ko-Wei Lih | Theoretical Computer Science 263(1-2), 355-377 | | | |
| 2020 | Approximation algorithms for constructing required subgraphs using stock pieces of fixed length | Lichen, Junran; Li, Jianping; Lih, Ko-Wei ; Yu, Xingxing | Journal of Combinatorial Optimization RESTRICTED ACCESS | | | |
| 2018 | Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces | Lichen, Junran; Li, Jianping; Lih, Ko-Wei | Information Processing Letters 137, 11-16 | | | |
| 2014 | Approximation algorithms for solving the constrained arc routing problem in mixed graphs | Honglin Ding; Jianping Li; Ko-Wei Lih | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 239, 80-88 | | | |
| 1987 | Bao Qi-Shou and his polyhedral Hun Yuan Tu | Lih, Ko-Wei | Science and Technology in Chinese Civilization (World Scientific, Singapore), 93-108 | | | |
| 2002 | Central circuit coverings of octahedrites and medial polyhedra | Deza, Michel; Huang, Tayuan; Lih, Ko-Wei | Journal of Mathematical Research and Exposition 22(1), 49-65 | | | |
| 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 | | | |
| 2013 | Chordal graphs are fully orientable | Lih, Ko-Wei ; Lai, Hsin-Hao | Ars Combinatoria | | | |
