A characterization of finite distributive planar lattices. - C. C. Chen; Khee Meng Koh (Discret. Math., 1973)

Two theorems on graceful trees. - Khee Meng Koh; T. Tan; Douglas G. Rogers (Discret. Math., 1979)

Products of graceful trees. - Khee Meng Koh; Douglas G. Rogers; T. Tan (Discret. Math., 1980)

Cycles with a chord are graceful. - Charles Delorme; Maryvonne Mahéo; Henri Thuillier; Khee Meng Koh; H. K. Teo (J. Graph Theory, 1980)

On the grading numbers of direct products of chains. - C. C. Chen; Khee Meng Koh; S. C. Lee (Discret. Math., 1984)

On a construction of critical graphs which are not sensitive. - Khee Meng Koh; K. S. Poh (Graphs Comb., 1985)

On the uniformity of the closed-set lattice of a tree. - Khee Meng Koh; K. S. Poh (Discret. Math., 1986)

Products of graphs with their closed-set lattices. - Khee Meng Koh; K. S. Poh (Discret. Math., 1988)

Constructions of sensitive graphs which are not strongly sensitive. - Khee Meng Koh; K. S. Poh (Discret. Math., 1988)

On the factor-thickness of regular graphs. - Y. H. Peng; C. C. Chen; Khee Meng Koh (Graphs Comb., 1989)

The 2-hamiltonian cubes of graphs. - Khee Meng Koh; Kee L. Teo (J. Graph Theory, 1989)

Two classes of chromatically unique graphs. - Khee Meng Koh; B. H. Goh (Discret. Math., 1990)

The search for chromatically unique graphs. - Khee Meng Koh; Kee L. Teo (Graphs Comb., 1990)

The chromaticity of complete bipartite graphs with at most one edge deleted. - Chung-Piaw Teo; Khee Meng Koh (J. Graph Theory, 1990)

The chromatic uniqueness of certain broken wheels. - Khee Meng Koh; Chung-Piaw Teo (Discret. Math., 1991)

On the spectrum of the closed-set lattice of a graph. - Khee Meng Koh; K. S. Poh (Australas. J Comb., 1992)

The number of shortest cycles and the chromatic uniqueness of a graph. - Chung-Piaw Teo; Khee Meng Koh (J. Graph Theory, 1992)

On the higher-order edge toughness of a graph. - C. C. Chen; Khee Meng Koh; Y. H. Peng (Discret. Math., 1993)

Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. - Khee Meng Koh; Kee L. Teo (Discret. Math., 1994)

On chromatic uniqueness of uniform subdivisions of graphs. - Chung-Piaw Teo; Khee Meng Koh (Discret. Math., 1994)

Kings in multipartite tournaments. - Khee Meng Koh; B. P. Tan (Discret. Math., 1995)

On the lower length of the closed-set lattice of a tree. - Khee Meng Koh; K. S. Poh (Discret. Math., 1996)

The diameter of an orientation of a complete multipartite graph. - Khee Meng Koh; B. P. Tan (Discret. Math., 1996)

Number of 4-kings in bipartite tournaments with no 3-kings. - Khee Meng Koh; B. P. Tan (Discret. Math., 1996)

Chromaticity of series-parallel graphs. - Khee Meng Koh; Chung-Piaw Teo (Discret. Math., 1996)

The minimum diameter of orientations of complete multipartite graphs. - Khee Meng Koh; B. P. Tan (Graphs Comb., 1996)

Triangle-Free Graphs with Large Degree. - C. C. Chen; G. P. Jin; Khee Meng Koh (Comb. Probab. Comput., 1997)

Optimal Orientations of Products of Paths and Cycles. - Khee Meng Koh; Eng Guan Tay (Discret. Appl. Math., 1997)

Preface. - C. C. Chen; Gek Ling Chia; Khee Meng Koh; N. Z. Li; Kee L. Teo (Discret. Math., 1997)

On the structure and chromaticity of graphs in which any two colour classes induce a tree. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 1997)

On graphs in which any pair of colour classes but one induces a tree. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 1997)

The search for chromatically unique graphs - II. - Khee Meng Koh; Kee L. Teo (Discret. Math., 1997)

The diameter of an orientation of a complete multipartite graph [Discrete Math 149 (1996) 131-139]. - Khee Meng Koh; B. P. Tan (Discret. Math., 1997)

The number of kings in a multipartite tournament. - Khee Meng Koh; B. P. Tan (Discret. Math., 1997)

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

On optimal orientations of cartesian products of graphs (I). - Khee Meng Koh; Eng Guan Tay (Discret. Math., 1998)

On optimal orientations of Cartesian products of even cycles. - Khee Meng Koh; Eng Guan Tay (Networks, 1998)

On Optimal Orientations of Cartesian Products with a Bipartite Graph. - Khee Meng Koh; Eng Guan Tay (Discret. Appl. Math., 1999)

Structures and chromaticity of some extremal 3-colourable graphs. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 1999)

Chromatically unique bipartite graphs with low 3-independent partition numbers. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Discret. Math., 2000)

An attempt to classify bipartite graphs by chromatic polynomials. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Discret. Math., 2000)

On optimal orientations of G vertex-multiplications. - Khee Meng Koh; Eng Guan Tay (Discret. Math., 2000)

On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles. - Khee Meng Koh; Eng Guan Tay (Discret. Math., 2000)

On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle. - Khee Meng Koh; Eng Guan Tay (Discret. Math., 2001)

Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo (Graphs Comb., 2001)

On Optimal Orientations of Cartesian Products of Trees. - Khee Meng Koh; Eng Guan Tay (Graphs Comb., 2001)

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

A note on the chromaticity of some 2-connected (n, n+3)-graphs. - Feng Ming Dong; Kee L. Teo; Khee Meng Koh (Discret. Math., 2002)

Non-chordal graphs having integral-root chromatic polynomials II. - Feng Ming Dong; Kee L. Teo; Khee Meng Koh; Michael D. Hendy (Discret. Math., 2002)

Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. - Gregory Z. Gutin; Khee Meng Koh; Eng Guan Tay; Anders Yeo (Graphs Comb., 2002)

Optimal Orientations of Graphs and Digraphs: A Survey. - Khee Meng Koh; Eng Guan Tay (Graphs Comb., 2002)

H-domination in graphs. - Khee Meng Koh; Bock Boom Lim; Peter J. Slater (Discret. Math., 2003)

Chromatically Unique Multibridge Graphs. - Feng Ming Dong; Kee L. Teo; Charles H. C. Little; Michael D. Hendy; Khee Meng Koh (Electron. J. Comb., 2004)

Two Results on Real Zeros of Chromatic Polynomials. - Feng Ming Dong; Khee Meng Koh (Comb. Probab. Comput., 2004)

On upper bounds for real roots of chromatic polynomials. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 2004)

Divisibility of certain coefficients of the chromatic polynomials. - Feng Ming Dong; Khee Meng Koh; C. A. Soh (Discret. Math., 2004)

On the number of quasi-kernels in digraphs. - Gregory Z. Gutin; Khee Meng Koh; Eng Guan Tay; Anders Yeo (J. Graph Theory, 2004)

The orientation number of two complete graphs with linkages. - Khee Meng Koh; Kah Loon Ng (Discret. Math., 2005)

On optimal orientation of cycle vertex multiplications. - Kah Loon Ng; Khee Meng Koh (Discret. Math., 2005)

On optimal orientations of tree vertex-multiplications. - Khee Meng Koh; Eng Guan Tay (Australas. J Comb., 2006)

Maximal independent sets in graphs with at most r cycles. - Goh Chee Ying; Khee Meng Koh; Bruce E. Sagan; Vincent R. Vatter (J. Graph Theory, 2006)

On Graphs Having No Chromatic Zeros in (1, 2). - Feng Ming Dong; Khee Meng Koh (SIAM J. Discret. Math., 2006)

Bounds for the coefficients of flow polynomials. - Feng Ming Dong; Khee Meng Koh (J. Comb. Theory B, 2007)

Bounds For The Real Zeros of Chromatic Polynomials. - Feng Ming Dong; Khee Meng Koh (Comb. Probab. Comput., 2008)

Domination numbers and zeros of chromatic polynomials. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 2008)

A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 2008)

On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). - Feng Ming Dong; Khee Meng Koh (Discret. Math., 2008)

The maximum number of maximal independent sets in unicyclic connected graphs. - Khee Meng Koh; Chyan-Yee Goh; Feng Ming Dong (Discret. Math., 2008)

Lower bound on the weakly connected domination number of a cycle-disjoint graph. - Khee Meng Koh; T. S. Ting; Z. L. Xu; Feng Ming Dong (Australas. J Comb., 2010)

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

A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set. - Khee Meng Koh; T. S. Ting; Feng Ming Dong (Australas. J Comb., 2012)

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

On the total restrained domination edge critical graphs. - Khee Meng Koh; Zeinab Maleki; Behnaz Omoomi (Ars Comb., 2013)

Max-min total restrained domination number. - Khee Meng Koh; Zeinab Maleki; Behnaz Omoomi (Ars Comb., 2013)

Reversing arcs in transitive tournaments to obtain maximum number of spanning cycles. - Khee Meng Koh; T. S. Ting (Ars Comb., 2013)

An Upper Bound for the Total Restrained Domination Number of Graphs. - Khee Meng Koh; Zeinab Maleki; Behnaz Omoomi (Graphs Comb., 2013)

On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two. - Khee Meng Koh; Zi-Xia Song (Graphs Comb., 2013)

Broadcast domination in graph products of paths. - Kian Wee Soh; Khee Meng Koh (Australas. J Comb., 2014)

Nowhere-zero 3-flows in Tensor Products of Graphs. - Feng Ming Dong; Eng Guan Tay; Khee Meng Koh (Ars Comb., 2014)

Counting the Number of Minimum Roman Dominating Functions of a Graph. - Zheng Shi; Khee Meng Koh (CoRR, 2014)

The gracefulness of the join of graphs (II). - Khee Meng Koh; L. Y. Phoon; Kian Wee Soh (AKCE Int. J. Graphs Comb., 2015)

The Nk-valued Roman Domination and Its Boundaries. - Andreas Dwi Maryanto Gunawan; Khee Meng Koh (Electron. Notes Discret. Math., 2015)

The Gracefulness of the Join of Graphs. - Khee Meng Koh; L. Y. Phoon; Kian Wee Soh (Electron. Notes Discret. Math., 2015)

Dominating Broadcast Labeling in Cartesian Products of Graphs. - Khee Meng Koh; Kian Wee Soh (Electron. Notes Discret. Math., 2015)

Power domination of the cartesian product of graphs. - Khee Meng Koh; Kian Wee Soh (AKCE Int. J. Graphs Comb., 2016)

On the power domination number of the Cartesian product of graphs. - Khee Meng Koh; Kian Wee Soh (AKCE Int. J. Graphs Comb., 2019)

Introduction to Graph Theory - With Solutions to Selected Problems - Khee Meng Koh; Fengming Dong; Eng Guan Tay (Introduction to Graph Theory, 2024)