Khee Meng Koh

Feng Ming Dong, Khee Meng Koh: The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial. Journal of Graph Theory 70(3): 262-283 (2012)

Feng Ming Dong, Khee Meng Koh: On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs. SIAM J. Discrete Math. 24(2): 370-378 (2010)

Feng Ming Dong, Khee Meng Koh: Bounds For The Real Zeros of Chromatic Polynomials. Combinatorics, Probability & Computing 17(6): 749-759 (2008)

Feng Ming Dong, Khee Meng Koh: Domination numbers and zeros of chromatic polynomials. Discrete Mathematics 308(10): 1930-1940 (2008)

Feng Ming Dong, Khee Meng Koh: A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. Discrete Mathematics 308(11): 2285-2287 (2008)

Khee Meng Koh, Chyan-Yee Goh, Feng Ming Dong: The maximum number of maximal independent sets in unicyclic connected graphs. Discrete Mathematics 308(17): 3761-3769 (2008)

Feng Ming Dong, Khee Meng Koh: On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). Discrete Mathematics 308(17): 3897-3905 (2008)

Feng Ming Dong, Khee Meng Koh: Bounds for the coefficients of flow polynomials. J. Comb. Theory, Ser. B 97(3): 413-420 (2007)

Feng Ming Dong, Khee Meng Koh: On Graphs Having No Chromatic Zeros in (1, 2). SIAM J. Discrete Math. 20(3): 799-810 (2006)

Khee Meng Koh, K. L. Ng: The orientation number of two complete graphs with linkages. Discrete Mathematics 295(1-3): 91-106 (2005)

Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh: Chromatically Unique Multibridge Graphs. Electr. J. Comb. 11(1) (2004)

Feng Ming Dong, Khee Meng Koh: Two Results on Real Zeros of Chromatic Polynomials. Combinatorics, Probability & Computing 13(6): 809-813 (2004)

Feng Ming Dong, Khee Meng Koh, C. A. Soh: Divisibility of certain coefficients of the chromatic polynomials. Discrete Mathematics 275(1-3): 311-317 (2004)

Feng Ming Dong, Khee Meng Koh: On upper bounds for real roots of chromatic polynomials. Discrete Mathematics 282(1-3): 95-101 (2004)

Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo: On the number of quasi-kernels in digraphs. Journal of Graph Theory 46(1): 48-56 (2004)

Khee Meng Koh, Bock Boom Lim, Peter J. Slater: H-domination in graphs. Discrete Mathematics 272(1): 97-105 (2003)

Feng Ming Dong, Kee L. Teo, Khee Meng Koh: A note on the chromaticity of some 2-connected (n, n+3)-graphs. Discrete Mathematics 243(1-3): 217-221 (2002)

Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy: Non-chordal graphs having integral-root chromatic polynomials II. Discrete Mathematics 245(1-3): 247-253 (2002)

Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo: Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. Graphs and Combinatorics 18(3): 499-506 (2002)

Khee Meng Koh, Eng Guan Tay: On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle. Discrete Mathematics 232(1-3): 153-161 (2001)

Khee Meng Koh, Eng Guan Tay: On Optimal Orientations of Cartesian Products of Trees. Graphs and Combinatorics 17(1): 79-97 (2001)

Feng Ming Dong, Khee Meng Koh, Kee L. Teo: Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. Graphs and Combinatorics 17(4): 611-635 (2001)

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy: Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. Journal of Graph Theory 37(1): 48-77 (2001)

Khee Meng Koh, Eng Guan Tay: On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles. Discrete Mathematics 211: 75-102 (2000)

Khee Meng Koh, Eng Guan Tay: On optimal orientations of G vertex-multiplications. Discrete Mathematics 219(1-3): 153-171 (2000)

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy: An attempt to classify bipartite graphs by chromatic polynomials. Discrete Mathematics 222(1-3): 73-88 (2000)

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy: Chromatically unique bipartite graphs with low 3-independent partition numbers. Discrete Mathematics 224(1-3): 107-124 (2000)

Khee Meng Koh, Eng Guan Tay: On Optimal Orientations of Cartesian Products with a Bipartite Graph. Discrete Applied Mathematics 98(1-2): 103-120 (1999)

Feng Ming Dong, Khee Meng Koh: Structures and chromaticity of some extremal 3-colourable graphs. Discrete Mathematics 203(1-3): 71-82 (1999)

Khee Meng Koh, Eng Guan Tay: On optimal orientations of Cartesian products of even cycles. Networks 32(4): 299-306 (1998)

Khee Meng Koh, Eng Guan Tay: Optimal Orientations of Products of Paths and Cycles. Discrete Applied Mathematics 78(1-3): 163-174 (1997)

Feng Ming Dong, Khee Meng Koh: On graphs in which any pair of colour classes but one induces a tree. Discrete Mathematics 169(1-3): 39-54 (1997)

Feng Ming Dong, Khee Meng Koh: On the structure and chromaticity of graphs in which any two colour classes induce a tree. Discrete Mathematics 176(1-3): 97-113 (1997)

Khee Meng Koh, Eng Guan Tay: On optimal orientations of Cartesian products of even cycles and paths. Networks 30(1): 1-7 (1997)