K.M. Koh

934 total citations
71 papers, 542 citations indexed

About

K.M. Koh is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Electrical and Electronic Engineering. According to data from OpenAlex, K.M. Koh has authored 71 papers receiving a total of 542 indexed citations (citations by other indexed papers that have themselves been cited), including 61 papers in Computational Theory and Mathematics, 28 papers in Geometry and Topology and 19 papers in Electrical and Electronic Engineering. Recurrent topics in K.M. Koh's work include Advanced Graph Theory Research (37 papers), Graph Labeling and Dimension Problems (33 papers) and Graph theory and applications (24 papers). K.M. Koh is often cited by papers focused on Advanced Graph Theory Research (37 papers), Graph Labeling and Dimension Problems (33 papers) and Graph theory and applications (24 papers). K.M. Koh collaborates with scholars based in Singapore, New Zealand and Canada. K.M. Koh's co-authors include Fengming Dong, Eng Guan Tay, Kok Lay Teo, Chung‐Piaw Teo, Douglas G. Rogers, George Grätzer, Michael Makkai, Michael D. Hendy, Charles H. C. Little and Shugao Ma and has published in prestigious journals such as SHILAP Revista de lepidopterología, Annals of the New York Academy of Sciences and Proceedings of the American Mathematical Society.

In The Last Decade

K.M. Koh

63 papers receiving 500 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
K.M. Koh Singapore 13 456 204 180 154 78 71 542
Charles Payan France 10 402 0.9× 108 0.5× 116 0.6× 88 0.6× 118 1.5× 27 481
R. E. L. Aldred New Zealand 13 465 1.0× 131 0.6× 184 1.0× 158 1.0× 118 1.5× 76 543
María Luz Puertas Spain 12 567 1.2× 188 0.9× 50 0.3× 147 1.0× 44 0.6× 48 628
Robert Woodrow Canada 12 390 0.9× 241 1.2× 218 1.2× 62 0.4× 20 0.3× 34 513
Alexander Kelmans United States 11 396 0.9× 306 1.5× 128 0.7× 84 0.5× 110 1.4× 43 526
Peter Che Bor Lam Hong Kong 14 370 0.8× 179 0.9× 90 0.5× 118 0.8× 53 0.7× 42 453
David P. Sumner United States 13 770 1.7× 300 1.5× 303 1.7× 103 0.7× 226 2.9× 23 811
Robert L. Hemminger United States 10 257 0.6× 100 0.5× 72 0.4× 55 0.4× 70 0.9× 33 354
Mohamed H. El-Zahar Canada 10 237 0.5× 120 0.6× 154 0.9× 68 0.4× 24 0.3× 23 329
Michael Stiebitz Germany 14 504 1.1× 150 0.7× 366 2.0× 79 0.5× 40 0.5× 51 555

Countries citing papers authored by K.M. Koh

Since Specialization
Citations

This map shows the geographic impact of K.M. Koh'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 K.M. Koh with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites K.M. Koh more than expected).

Fields of papers citing papers by K.M. Koh

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by K.M. Koh. 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 K.M. Koh. The network helps show where K.M. Koh may publish in the future.

Co-authorship network of co-authors of K.M. Koh

This figure shows the co-authorship network connecting the top 25 collaborators of K.M. Koh. A scholar is included among the top collaborators of K.M. Koh 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 K.M. Koh. K.M. Koh 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.
Koh, K.M., et al.. (2020). A note on Power Domination Problem in Diameter Two Graphs. AKCE International Journal of Graphs and Combinatorics.
2.
Koh, K.M., et al.. (2018). Recent Results on the Power Domination Numbers of Graph Products. 48. 41–53. 3 indexed citations
3.
Dong, Fengming & K.M. Koh. (2007). On planar and non-planar graphs having no chromatic zeros in the interval (1,2). Discrete Mathematics. 308(17). 3897–3905.
4.
Koh, K.M., et al.. (2007). The maximum number of maximal independent sets in unicyclic connected graphs. Discrete Mathematics. 308(17). 3761–3769. 16 indexed citations
5.
Dong, Fengming & K.M. Koh. (2007). Domination numbers and zeros of chromatic polynomials. Discrete Mathematics. 308(10). 1930–1940.
6.
Koh, K.M., et al.. (2006). On optimal summable graphs. AKCE International Journal of Graphs and Combinatorics. 1 indexed citations
7.
Dong, Fengming & K.M. Koh. (2006). Bounds for the coefficients of flow polynomials. Journal of Combinatorial Theory Series B. 97(3). 413–420.
8.
Koh, K.M., et al.. (2005). The orientation number of two complete graphs with linkages. Discrete Mathematics. 295(1-3). 91–106. 5 indexed citations
9.
Dong, Fengming & K.M. Koh. (2004). On upper bounds for real roots of chromatic polynomials. Discrete Mathematics. 282(1-3). 95–101. 1 indexed citations
10.
Koh, K.M. & Eng Guan Tay. (2001). On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle. Discrete Mathematics. 232(1-3). 153–161. 3 indexed citations
11.
Koh, K.M. & Eng Guan Tay. (1998). On optimal orientations of cartesian products of graphs (I). Discrete Mathematics. 190(1-3). 115–136. 9 indexed citations
12.
Dong, Fengming & K.M. Koh. (1997). On the structure and chromaticity of graphs in which any two colour classes induce a tree. Discrete Mathematics. 176(1-3). 97–113. 4 indexed citations
13.
Koh, K.M. & Eng Guan Tay. (1997). Optimal orientations of products of paths and cycles. Discrete Applied Mathematics. 78(1-3). 163–174. 13 indexed citations
14.
Koh, K.M., et al.. (1997). The diameter of an orientation of a complete multipartite graph [Discrete Math. 149 (1996) 131–139]. Discrete Mathematics. 173(1-3). 297–298. 4 indexed citations
15.
Koh, K.M., et al.. (1997). The search for chromatically unique graphs — II. Discrete Mathematics. 172(1-3). 59–78. 39 indexed citations
16.
Koh, K.M., et al.. (1996). The diameter of an orientation of a complete multipartite graph. Discrete Mathematics. 149(1-3). 131–139. 16 indexed citations
17.
Teo, Chung‐Piaw & K.M. Koh. (1994). On chromatic uniqueness of uniform subdivisions of graphs. Discrete Mathematics. 128(1-3). 327–335. 2 indexed citations
18.
Koh, K.M., et al.. (1994). Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. Discrete Mathematics. 127(1-3). 243–258. 5 indexed citations
19.
Koh, K.M., et al.. (1993). On the higher-order edge toughness of a graph. Discrete Mathematics. 111(1-3). 113–123. 10 indexed citations
20.
Koh, K.M., et al.. (1979). Two theorems on graceful trees. Discrete Mathematics. 25(2). 141–148. 15 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

Rankless by CCL
2026