Khee Meng Koh

86 papers Journal 85
YearRankTypeTitle / Venue / Authors
2024 — book
Introduction to Graph Theory - With Solutions to Selected Problems
Introduction to Graph Theory
Khee Meng Koh, Fengming Dong, Eng Guan Tay
2019 J jnl
On the power domination number of the Cartesian product of graphs.
AKCE Int. J. Graphs Comb.
Khee Meng Koh, Kian Wee Soh
2016 J jnl
Power domination of the cartesian product of graphs.
AKCE Int. J. Graphs Comb.
Khee Meng Koh, Kian Wee Soh
2015 J jnl
Dominating Broadcast Labeling in Cartesian Products of Graphs.
Electron. Notes Discret. Math.
Khee Meng Koh, Kian Wee Soh
2015 J jnl
The Gracefulness of the Join of Graphs.
Electron. Notes Discret. Math.
Khee Meng Koh, L. Y. Phoon, Kian Wee Soh
2015 J jnl
The Nk-valued Roman Domination and Its Boundaries.
Electron. Notes Discret. Math.
Andreas Dwi Maryanto Gunawan, Khee Meng Koh
2015 J jnl
The gracefulness of the join of graphs (II).
AKCE Int. J. Graphs Comb.
Khee Meng Koh, L. Y. Phoon, Kian Wee Soh
2014 J jnl
Broadcast domination in graph products of paths.
Australas. J Comb.
Kian Wee Soh, Khee Meng Koh
2014 J jnl
Counting the Number of Minimum Roman Dominating Functions of a Graph.
CoRR
Zheng Shi, Khee Meng Koh
2014 J jnl
Nowhere-zero 3-flows in Tensor Products of Graphs.
Ars Comb.
Feng Ming Dong, Eng Guan Tay, Khee Meng Koh
2013 J jnl
An Upper Bound for the Total Restrained Domination Number of Graphs.
Graphs Comb.
Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
2013 J jnl
Max-min total restrained domination number.
Ars Comb.
Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
2013 J jnl
On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two.
Graphs Comb.
Khee Meng Koh, Zi-Xia Song
2013 J jnl
On the total restrained domination edge critical graphs.
Ars Comb.
Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi
2013 J jnl
Reversing arcs in transitive tournaments to obtain maximum number of spanning cycles.
Ars Comb.
Khee Meng Koh, T. S. Ting
2012 J jnl
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set.
Australas. J Comb.
Khee Meng Koh, T. S. Ting, Feng Ming Dong
2012 J jnl
The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial.
J. Graph Theory
Feng Ming Dong, Khee Meng Koh
2010 J jnl
Lower bound on the weakly connected domination number of a cycle-disjoint graph.
Australas. J Comb.
Khee Meng Koh, T. S. Ting, Z. L. Xu, Feng Ming Dong
2010 J jnl
On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs.
SIAM J. Discret. Math.
Feng Ming Dong, Khee Meng Koh
2008 J jnl
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs.
Discret. Math.
Feng Ming Dong, Khee Meng Koh
2008 J jnl
Bounds For The Real Zeros of Chromatic Polynomials.
Comb. Probab. Comput.
Feng Ming Dong, Khee Meng Koh
2008 J jnl
Domination numbers and zeros of chromatic polynomials.
Discret. Math.
Feng Ming Dong, Khee Meng Koh
2008 J jnl
On planar and non-planar graphs having no chromatic zeros in the interval (1, 2).
Discret. Math.
Feng Ming Dong, Khee Meng Koh
2008 J jnl
The maximum number of maximal independent sets in unicyclic connected graphs.
Discret. Math.
Khee Meng Koh, Chyan-Yee Goh, Feng Ming Dong
2007 J jnl
Bounds for the coefficients of flow polynomials.
J. Comb. Theory B
Feng Ming Dong, Khee Meng Koh
2006 J jnl
Maximal independent sets in graphs with at most
J. Graph Theory
Goh Chee Ying, Khee Meng Koh, Bruce E. Sagan, Vincent R. Vatter
2006 J jnl
On Graphs Having No Chromatic Zeros in (1, 2).
SIAM J. Discret. Math.
Feng Ming Dong, Khee Meng Koh
2006 J jnl
On optimal orientations of tree vertex-multiplications.
Australas. J Comb.
Khee Meng Koh, Eng Guan Tay
2005 J jnl
On optimal orientation of cycle vertex multiplications.
Discret. Math.
Kah Loon Ng, Khee Meng Koh
2005 J jnl
The orientation number of two complete graphs with linkages.
Discret. Math.
Khee Meng Koh, Kah Loon Ng
2004 J jnl
Chromatically Unique Multibridge Graphs.
Electron. J. Comb.
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
2004 J jnl
Divisibility of certain coefficients of the chromatic polynomials.
Discret. Math.
Feng Ming Dong, Khee Meng Koh, C. A. Soh
2004 J jnl
On the number of quasi-kernels in digraphs.
J. Graph Theory
Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
2004 J jnl
On upper bounds for real roots of chromatic polynomials.
Discret. Math.
Feng Ming Dong, Khee Meng Koh
2004 J jnl
Two Results on Real Zeros of Chromatic Polynomials.
Comb. Probab. Comput.
Feng Ming Dong, Khee Meng Koh
2002 J jnl
A note on the chromaticity of some 2-connected (n, n+3)-graphs.
Discret. Math.
Feng Ming Dong, Kee L. Teo, Khee Meng Koh
2002 J jnl
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs.
Graphs Comb.
Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
2002 J jnl
Non-chordal graphs having integral-root chromatic polynomials II.
Discret. Math.
Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
2002 J jnl
Optimal Orientations of Graphs and Digraphs: A Survey.
Graphs Comb.
Khee Meng Koh, Eng Guan Tay
2001 J jnl
On Optimal Orientations of Cartesian Products of Trees.
Graphs Comb.
Khee Meng Koh, Eng Guan Tay
2001 J jnl
On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle.
Discret. Math.
Khee Meng Koh, Eng Guan Tay
2001 J jnl
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs.
J. Graph Theory
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy
2001 J jnl
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs.
Graphs Comb.
Feng Ming Dong, Khee Meng Koh, Kee L. Teo
2000 J jnl
An attempt to classify bipartite graphs by chromatic polynomials.
Discret. Math.
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2000 J jnl
Chromatically unique bipartite graphs with low 3-independent partition numbers.
Discret. Math.
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2000 J jnl
On optimal orientations of
Discret. Math.
Khee Meng Koh, Eng Guan Tay
2000 J jnl
On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles.
Discret. Math.
Khee Meng Koh, Eng Guan Tay
1999 J jnl
On Optimal Orientations of Cartesian Products with a Bipartite Graph.
Discret. Appl. Math.
Khee Meng Koh, Eng Guan Tay
1999 J jnl
Structures and chromaticity of some extremal 3-colourable graphs.
Discret. Math.
Feng Ming Dong, Khee Meng Koh
1998 J jnl
On optimal orientations of Cartesian products of even cycles.
Networks
Khee Meng Koh, Eng Guan Tay
1998 J jnl
On optimal orientations of cartesian products of graphs (I).
Discret. Math.
Khee Meng Koh, Eng Guan Tay
1997 J jnl
On graphs in which any pair of colour classes but one induces a tree.
Discret. Math.
Feng Ming Dong, Khee Meng Koh
1997 J jnl
On optimal orientations of Cartesian products of even cycles and paths.
Networks
Khee Meng Koh, Eng Guan Tay
1997 J jnl
On the structure and chromaticity of graphs in which any two colour classes induce a tree.
Discret. Math.
Feng Ming Dong, Khee Meng Koh
1997 J jnl
Optimal Orientations of Products of Paths and Cycles.
Discret. Appl. Math.
Khee Meng Koh, Eng Guan Tay
1997 J jnl
Preface.
Discret. Math.
C. C. Chen, Gek Ling Chia, Khee Meng Koh, N. Z. Li, Kee L. Teo
1997 J jnl
The diameter of an orientation of a complete multipartite graph [Discrete Math 149 (1996) 131-139].
Discret. Math.
Khee Meng Koh, B. P. Tan
1997 J jnl
The number of kings in a multipartite tournament.
Discret. Math.
Khee Meng Koh, B. P. Tan
1997 J jnl
The search for chromatically unique graphs - II.
Discret. Math.
Khee Meng Koh, Kee L. Teo
1997 J jnl
Triangle-Free Graphs with Large Degree.
Comb. Probab. Comput.
C. C. Chen, G. P. Jin, Khee Meng Koh
1996 J jnl
Chromaticity of series-parallel graphs.
Discret. Math.
Khee Meng Koh, Chung-Piaw Teo
1996 J jnl
Number of 4-kings in bipartite tournaments with no 3-kings.
Discret. Math.
Khee Meng Koh, B. P. Tan
1996 J jnl
On the lower length of the closed-set lattice of a tree.
Discret. Math.
Khee Meng Koh, K. S. Poh
1996 J jnl
The diameter of an orientation of a complete multipartite graph.
Discret. Math.
Khee Meng Koh, B. P. Tan
1996 J jnl
The minimum diameter of orientations of complete multipartite graphs.
Graphs Comb.
Khee Meng Koh, B. P. Tan
1995 J jnl
Kings in multipartite tournaments.
Discret. Math.
Khee Meng Koh, B. P. Tan
1994 J jnl
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles.
Discret. Math.
Khee Meng Koh, Kee L. Teo
1994 J jnl
On chromatic uniqueness of uniform subdivisions of graphs.
Discret. Math.
Chung-Piaw Teo, Khee Meng Koh
1993 J jnl
On the higher-order edge toughness of a graph.
Discret. Math.
C. C. Chen, Khee Meng Koh, Y. H. Peng
1992 J jnl
On the spectrum of the closed-set lattice of a graph.
Australas. J Comb.
Khee Meng Koh, K. S. Poh
1992 J jnl
The number of shortest cycles and the chromatic uniqueness of a graph.
J. Graph Theory
Chung-Piaw Teo, Khee Meng Koh
1991 J jnl
The chromatic uniqueness of certain broken wheels.
Discret. Math.
Khee Meng Koh, Chung-Piaw Teo
1990 J jnl
The chromaticity of complete bipartite graphs with at most one edge deleted.
J. Graph Theory
Chung-Piaw Teo, Khee Meng Koh
1990 J jnl
The search for chromatically unique graphs.
Graphs Comb.
Khee Meng Koh, Kee L. Teo
1990 J jnl
Two classes of chromatically unique graphs.
Discret. Math.
Khee Meng Koh, B. H. Goh
1989 J jnl
On the factor-thickness of regular graphs.
Graphs Comb.
Y. H. Peng, C. C. Chen, Khee Meng Koh
1989 J jnl
The 2-hamiltonian cubes of graphs.
J. Graph Theory
Khee Meng Koh, Kee L. Teo
1988 J jnl
Constructions of sensitive graphs which are not strongly sensitive.
Discret. Math.
Khee Meng Koh, K. S. Poh
1988 J jnl
Products of graphs with their closed-set lattices.
Discret. Math.
Khee Meng Koh, K. S. Poh
1986 J jnl
On the uniformity of the closed-set lattice of a tree.
Discret. Math.
Khee Meng Koh, K. S. Poh
1985 J jnl
On a construction of critical graphs which are not sensitive.
Graphs Comb.
Khee Meng Koh, K. S. Poh
1984 J jnl
On the grading numbers of direct products of chains.
Discret. Math.
C. C. Chen, Khee Meng Koh, S. C. Lee
1980 J jnl
Cycles with a chord are graceful.
J. Graph Theory
Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo
1980 J jnl
Products of graceful trees.
Discret. Math.
Khee Meng Koh, Douglas G. Rogers, T. Tan
1979 J jnl
Two theorems on graceful trees.
Discret. Math.
Khee Meng Koh, T. Tan, Douglas G. Rogers
1973 J jnl
A characterization of finite distributive planar lattices.
Discret. Math.
C. C. Chen, Khee Meng Koh