K. M. Koh

	2005
27		K. L. Ng, K. M. Koh: On optimal orientation of cycle vertex multiplications. Discrete Mathematics 297(1-3): 104-118 (2005)
	2002
26		K. M. Koh, E. G. Tay: Optimal Orientations of Graphs and Digraphs: A Survey. Graphs and Combinatorics 18(4): 745-756 (2002)
	1998
25		K. M. Koh, E. G. Tay: On optimal orientations of cartesian products of graphs (I). Discrete Mathematics 190(1-3): 115-136 (1998)
	1997
24		C. C. Chen, G. P. Jin, K. M. Koh: Triangle-Free Graphs with Large Degree. Combinatorics, Probability & Computing 6(4): 381-396 (1997)
23		K. M. Koh, B. P. Tan: The number of kings in a multipartite tournament. Discrete Mathematics 167-168: 411-418 (1997)
22		C. C. Chen, G. L. Chia, K. M. Koh, N. Z. Li, K. L. Teo: Preface. Discrete Mathematics 172(1-3): 1 (1997)
21		K. M. Koh, K. L. Teo: The search for chromatically unique graphs - II. Discrete Mathematics 172(1-3): 59-78 (1997)
20		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
19		K. M. Koh, B. P. Tan: The diameter of an orientation of a complete multipartite graph. Discrete Mathematics 149(1-3): 131-139 (1996)
18		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)
17		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)
16		K. M. Koh, C. P. Teo: Chromaticity of series-parallel graphs. Discrete Mathematics 154(1-3): 289-295 (1996)
15		K. M. Koh, B. P. Tan: The minimum diameter of orientations of complete multipartite graphs. Graphs and Combinatorics 12(1): 333-339 (1996)
	1995
14		K. M. Koh, B. P. Tan: Kings in multipartite tournaments. Discrete Mathematics 147(1-3): 171-183 (1995)
	1994
13		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)
12		C. P. Teo, K. M. Koh: On chromatic uniqueness of uniform subdivisions of graphs. Discrete Mathematics 128(1-3): 327-335 (1994)
	1993
11		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
10		K. M. Koh, C. P. Teo: The chromatic uniqueness of certain broken wheels. Discrete Mathematics 96(1): 65-69 (1991)
	1990
9		K. M. Koh, B. H. Goh: Two classes of chromatically unique graphs. Discrete Mathematics 82(1): 13-24 (1990)
8		K. M. Koh, K. L. Teo: The search for chromatically unique graphs. Graphs and Combinatorics 6(3): 259-285 (1990)
	1989
7		Y. H. Peng, C. C. Chen, K. M. Koh: On the factor-thickness of regular graphs. Graphs and Combinatorics 5(1): 173-188 (1989)
	1988
6		K. M. Koh, K. S. Poh: Products of graphs with their closed-set lattices. Discrete Mathematics 69(3): 241-251 (1988)
5		K. M. Koh, K. S. Poh: Constructions of sensitive graphs which are not strongly sensitive. Discrete Mathematics 72(1-3): 225-236 (1988)
	1986
4		K. M. Koh, K. S. Poh: On the uniformity of the closed-set lattice of a tree. Discrete Mathematics 61(1): 61-70 (1986)
	1985
3		K. M. Koh, K. S. Poh: On a construction of critical graphs which are not sensitive. Graphs and Combinatorics 1(1): 265-270 (1985)
	1984
2		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		K. M. Koh, D. G. Rogers, T. Tan: Products of graceful trees. Discrete Mathematics 31(3): 279-292 (1980)

Coauthor Index

1	C. C. Chen	[2] [7] [11] [22] [24]
2	G. L. Chia	[22]
3	B. H. Goh	[9]
4	G. P. Jin	[24]
5	S. C. Lee	[2]
6	N. Z. Li	[22]
7	K. L. Ng	[27]
8	Y. H. Peng	[7] [11]
9	K. S. Poh	[3] [4] [5] [6] [18]
10	D. G. Rogers	[1]
11	B. P. Tan	[14] [15] [17] [19] [20] [23]
12	T. Tan	[1]
13	E. G. Tay	[25] [26]
14	C. P. Teo	[10] [12] [16]
15	K. L. Teo	[8] [13] [21] [22]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page