Ko‐Wei Lih

1.3k total citations
53 papers, 762 citations indexed

About

Ko‐Wei Lih is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Ko‐Wei Lih has authored 53 papers receiving a total of 762 indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computational Theory and Mathematics, 17 papers in Discrete Mathematics and Combinatorics and 12 papers in Geometry and Topology. Recurrent topics in Ko‐Wei Lih's work include Advanced Graph Theory Research (42 papers), Graph Labeling and Dimension Problems (21 papers) and Limits and Structures in Graph Theory (15 papers). Ko‐Wei Lih is often cited by papers focused on Advanced Graph Theory Research (42 papers), Graph Labeling and Dimension Problems (21 papers) and Limits and Structures in Graph Theory (15 papers). Ko‐Wei Lih collaborates with scholars based in Taiwan, China and United States. Ko‐Wei Lih's co-authors include Weifan Wang, Weifan Wang, Yiqiao Wang, Xuding Zhu, Wei Gao, Daphne Der‐Fen Liu, Kemin Zhang, Wenjie He, F. K. Hwang and Gerard J. Chang and has published in prestigious journals such as American Mathematical Monthly, Theoretical Computer Science and Proceedings of the American Mathematical Society.

In The Last Decade

Ko‐Wei Lih

48 papers receiving 695 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Ko‐Wei Lih Taiwan 14 651 244 149 105 104 53 762
Chı́nh T. Hoàng Canada 18 895 1.4× 389 1.6× 144 1.0× 150 1.4× 42 0.4× 78 957
Geoffrey Exoo United States 12 424 0.7× 267 1.1× 191 1.3× 238 2.3× 35 0.3× 61 609
Frédéric Maffray France 16 1.0k 1.6× 480 2.0× 148 1.0× 186 1.8× 43 0.4× 111 1.1k
Paul Wollan Italy 13 445 0.7× 220 0.9× 49 0.3× 89 0.8× 44 0.4× 34 484
Wenan Zang Hong Kong 12 339 0.5× 167 0.7× 82 0.6× 87 0.8× 34 0.3× 56 415
Iztok Peterin Slovenia 11 359 0.6× 123 0.5× 66 0.4× 134 1.3× 12 0.1× 71 408
Ismael G. Yero Spain 16 961 1.5× 74 0.3× 202 1.4× 245 2.3× 24 0.2× 112 1.0k
Csilla Bujtás Hungary 13 408 0.6× 186 0.8× 127 0.9× 64 0.6× 21 0.2× 72 492
Kristina Vušković United Kingdom 15 577 0.9× 246 1.0× 98 0.7× 91 0.9× 18 0.2× 48 632
Frédéric Havet France 16 675 1.0× 282 1.2× 209 1.4× 67 0.6× 62 0.6× 96 746

Countries citing papers authored by Ko‐Wei Lih

Since Specialization
Citations

This map shows the geographic impact of Ko‐Wei Lih's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Ko‐Wei Lih with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ko‐Wei Lih more than expected).

Fields of papers citing papers by Ko‐Wei Lih

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ko‐Wei Lih. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Ko‐Wei Lih. The network helps show where Ko‐Wei Lih may publish in the future.

Co-authorship network of co-authors of Ko‐Wei Lih

This figure shows the co-authorship network connecting the top 25 collaborators of Ko‐Wei Lih. A scholar is included among the top collaborators of Ko‐Wei Lih based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Ko‐Wei Lih. Ko‐Wei Lih is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Wang, Yan, et al.. (2023). Partitioning kite‐free planar graphs into two forests. Journal of Graph Theory. 106(1). 30–56.
2.
Lih, Ko‐Wei, et al.. (2019). Light structures in 1-planar graphs with an application to linear 2-arboricity. Discrete Applied Mathematics. 267. 120–130. 10 indexed citations
3.
Lih, Ko‐Wei & Daphne Der‐Fen Liu. (2011). On the strong chromatic index of cubic Halin graphs. Applied Mathematics Letters. 25(5). 898–901. 13 indexed citations
4.
Lih, Ko‐Wei, et al.. (2011). The strong chromatic index of Halin graphs. Discrete Mathematics. 312(9). 1536–1541. 17 indexed citations
5.
Wang, Yingqian, et al.. (2009). On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. Applied Mathematics Letters. 22(9). 1369–1373. 10 indexed citations
6.
Lih, Ko‐Wei, et al.. (2008). 92.80 The edge-choosability of the tetrahedron. The Mathematical Gazette. 92(525). 543–546. 2 indexed citations
7.
Lih, Ko‐Wei, Daphne Der‐Fen Liu, & Weifan Wang. (2008). On (d,1)-total numbers of graphs. Discrete Mathematics. 309(12). 3767–3773. 17 indexed citations
8.
Wang, Weifan & Ko‐Wei Lih. (2005). List coloring Halin graphs. Ars Combinatoria. 77. 53–63. 5 indexed citations
9.
Lih, Ko‐Wei, et al.. (2005). On an interpolation property of outerplanar graphs. Discrete Applied Mathematics. 154(1). 166–172. 5 indexed citations
10.
Wang, Weifan & Ko‐Wei Lih. (2005). On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability. European Journal of Combinatorics. 28(1). 111–120. 1 indexed citations
11.
Wang, Weifan & Ko‐Wei Lih. (2004). EQUITABLE LIST COLORING OF GRAPHS. Taiwanese Journal of Mathematics. 8(4). 747–759. 8 indexed citations
12.
Lih, Ko‐Wei, et al.. (2004). The Linear 2-Arboricity of Outerplanar Graphs.. Ars Combinatoria. 73(8). 13–22. 6 indexed citations
13.
Lih, Ko‐Wei, Weifan Wang, & Xuding Zhu. (2003). Coloring the square of a K4-minor free graph. Discrete Mathematics. 269(1-3). 303–309. 50 indexed citations
14.
Lih, Ko‐Wei, et al.. (2002). Edge-pancyclicity of coupled graphs. Discrete Applied Mathematics. 119(3). 259–264. 7 indexed citations
15.
Wang, Weifan & Ko‐Wei Lih. (2001). The 4-choosability of planar graphs without 6-cycles.. Australas. J Comb.. 24. 157–164. 8 indexed citations
16.
Lih, Ko‐Wei, et al.. (2001). A note on list improper coloring planar graphs. Applied Mathematics Letters. 14(3). 269–273. 27 indexed citations
17.
Lih, Ko‐Wei, et al.. (1994). Equitable Coloring and the Maximum Degree. European Journal of Combinatorics. 15(5). 443–447. 80 indexed citations
18.
Lih, Ko‐Wei, et al.. (1994). Equitable Coloring of Trees. Journal of Combinatorial Theory Series B. 61(1). 83–87. 49 indexed citations
19.
Lih, Ko‐Wei. (1987). Problems in Finite Extremal Set Theory. Kyoto University Research Information Repository (Kyoto University). 607. 1–4. 2 indexed citations
20.
Lih, Ko‐Wei, et al.. (1981). Monotonicity Conjecture on Permanents of Doubly Stochastic Matrices. Proceedings of the American Mathematical Society. 82(2). 173–173. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Chı́nh T. Hoàng Breakdown of academic impact, for papers by Geoffrey Exoo Breakdown of academic impact, for papers by Frédéric Maffray Breakdown of academic impact, for papers by Paul Wollan Breakdown of academic impact, for papers by Wenan Zang Breakdown of academic impact, for papers by Iztok Peterin Breakdown of academic impact, for papers by Ismael G. Yero Breakdown of academic impact, for papers by Csilla Bujtás Breakdown of academic impact, for papers by Kristina Vušković Breakdown of academic impact, for papers by Frédéric Havet
Rankless by CCL
2026