| 2005 |
|---|
| 23 | EE | K. L. Ng,
K. M. Koh:
On optimal orientation of cycle vertex multiplications.
Discrete Mathematics 297(1-3): 104-118 (2005) |
| 2002 |
|---|
| 22 | EE | K. M. Koh,
E. G. Tay:
Optimal Orientations of Graphs and Digraphs: A Survey.
Graphs and Combinatorics 18(4): 745-756 (2002) |
| 1998 |
|---|
| 21 | EE | K. M. Koh,
E. G. Tay:
On optimal orientations of cartesian products of graphs (I).
Discrete Mathematics 190(1-3): 115-136 (1998) |
| 1997 |
|---|
| 20 | | C. C. Chen,
G. P. Jin,
K. M. Koh:
Triangle-Free Graphs with Large Degree.
Combinatorics, Probability & Computing 6(4): 381-396 (1997) |
| 19 | EE | K. M. Koh,
B. P. Tan:
The number of kings in a multipartite tournament.
Discrete Mathematics 167-168: 411-418 (1997) |
| 18 | EE | C. C. Chen,
G. L. Chia,
K. M. Koh,
N. Z. Li,
K. L. Teo:
Preface.
Discrete Mathematics 172(1-3): 1 (1997) |
| 17 | EE | K. M. Koh,
K. L. Teo:
The search for chromatically unique graphs - II.
Discrete Mathematics 172(1-3): 59-78 (1997) |
| 16 | EE | K. M. Koh,
B. P. Tan:
The diameter of an orientation of a complete multipartite graph [Discrete Math 149 (1996) 131-139].
Discrete Mathematics 173(1-3): 297-298 (1997) |
| 1996 |
|---|
| 15 | EE | K. M. Koh,
B. P. Tan:
The diameter of an orientation of a complete multipartite graph.
Discrete Mathematics 149(1-3): 131-139 (1996) |
| 14 | EE | K. M. Koh,
K. S. Poh:
On the lower length of the closed-set lattice of a tree.
Discrete Mathematics 151(1-3): 121-130 (1996) |
| 13 | EE | K. M. Koh,
B. P. Tan:
Number of 4-kings in bipartite tournaments with no 3-kings.
Discrete Mathematics 154(1-3): 281-287 (1996) |
| 12 | EE | K. M. Koh,
C. P. Teo:
Chromaticity of series-parallel graphs.
Discrete Mathematics 154(1-3): 289-295 (1996) |
| 1995 |
|---|
| 11 | EE | K. M. Koh,
B. P. Tan:
Kings in multipartite tournaments.
Discrete Mathematics 147(1-3): 171-183 (1995) |
| 1994 |
|---|
| 10 | EE | K. M. Koh,
K. L. Teo:
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles.
Discrete Mathematics 127(1-3): 243-258 (1994) |
| 9 | EE | C. P. Teo,
K. M. Koh:
On chromatic uniqueness of uniform subdivisions of graphs.
Discrete Mathematics 128(1-3): 327-335 (1994) |
| 1993 |
|---|
| 8 | EE | C. C. Chen,
K. M. Koh,
Y. H. Peng:
On the higher-order edge toughness of a graph.
Discrete Mathematics 111(1-3): 113-123 (1993) |
| 1991 |
|---|
| 7 | EE | K. M. Koh,
C. P. Teo:
The chromatic uniqueness of certain broken wheels.
Discrete Mathematics 96(1): 65-69 (1991) |
| 1990 |
|---|
| 6 | EE | K. M. Koh,
B. H. Goh:
Two classes of chromatically unique graphs.
Discrete Mathematics 82(1): 13-24 (1990) |
| 1988 |
|---|
| 5 | EE | K. M. Koh,
K. S. Poh:
Products of graphs with their closed-set lattices.
Discrete Mathematics 69(3): 241-251 (1988) |
| 4 | EE | K. M. Koh,
K. S. Poh:
Constructions of sensitive graphs which are not strongly sensitive.
Discrete Mathematics 72(1-3): 225-236 (1988) |
| 1986 |
|---|
| 3 | EE | K. M. Koh,
K. S. Poh:
On the uniformity of the closed-set lattice of a tree.
Discrete Mathematics 61(1): 61-70 (1986) |
| 1984 |
|---|
| 2 | EE | C. C. Chen,
K. M. Koh,
S. C. Lee:
On the grading numbers of direct products of chains.
Discrete Mathematics 49(1): 21-26 (1984) |
| 1980 |
|---|
| 1 | EE | K. M. Koh,
D. G. Rogers,
T. Tan:
Products of graceful trees.
Discrete Mathematics 31(3): 279-292 (1980) |
