default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKhee Meng Koh
Person information
- affiliation: National University of Singapore, Department of Mathematics, Singapore
- affiliation: Nanyang University, Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Khee Meng Koh, Fengming Dong, Eng Guan Tay:
Introduction to Graph Theory - With Solutions to Selected Problems. WorldScientific 2024, ISBN 9789811284816, pp. 1-308
2010 – 2019
- 2019
- [j85]Khee Meng Koh, Kian Wee Soh
:
On the power domination number of the Cartesian product of graphs. AKCE Int. J. Graphs Comb. 16(3): 253-257 (2019) - 2016
- [j84]Khee Meng Koh, Kian Wee Soh:
Power domination of the cartesian product of graphs. AKCE Int. J. Graphs Comb. 13(1): 22-30 (2016) - 2015
- [j83]Khee Meng Koh, L. Y. Phoon, Kian Wee Soh:
The gracefulness of the join of graphs (II). AKCE Int. J. Graphs Comb. 12(Issues): 180-185 (2015) - [j82]Khee Meng Koh, L. Y. Phoon, Kian Wee Soh:
The Gracefulness of the Join of Graphs. Electron. Notes Discret. Math. 48: 57-64 (2015) - [j81]Andreas Dwi Maryanto Gunawan, Khee Meng Koh:
The Nk-valued Roman Domination and Its Boundaries. Electron. Notes Discret. Math. 48: 95-102 (2015) - [j80]Khee Meng Koh, Kian Wee Soh:
Dominating Broadcast Labeling in Cartesian Products of Graphs. Electron. Notes Discret. Math. 48: 197-204 (2015) - 2014
- [j79]Kian Wee Soh, Khee Meng Koh:
Broadcast domination in graph products of paths. Australas. J Comb. 59: 342-351 (2014) - [j78]Feng Ming Dong, Eng Guan Tay, Khee Meng Koh:
Nowhere-zero 3-flows in Tensor Products of Graphs. Ars Comb. 117: 375-386 (2014) - [i1]Zheng Shi, Khee Meng Koh:
Counting the Number of Minimum Roman Dominating Functions of a Graph. CoRR abs/1403.1019 (2014) - 2013
- [j77]Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi:
On the total restrained domination edge critical graphs. Ars Comb. 109: 97-112 (2013) - [j76]Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi:
Max-min total restrained domination number. Ars Comb. 112: 161-174 (2013) - [j75]Khee Meng Koh, T. S. Ting:
Reversing arcs in transitive tournaments to obtain maximum number of spanning cycles. Ars Comb. 112: 503- (2013) - [j74]Khee Meng Koh, Zi-Xia Song:
On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two. Graphs Comb. 29(5): 1429-1441 (2013) - [j73]Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi:
An Upper Bound for the Total Restrained Domination Number of Graphs. Graphs Comb. 29(5): 1443-1452 (2013) - 2012
- [j72]Khee Meng Koh, T. S. Ting, Feng Ming Dong:
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set. Australas. J Comb. 54: 177-188 (2012) - [j71]Feng Ming Dong, Khee Meng Koh:
The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial. J. Graph Theory 70(3): 262-283 (2012) - 2010
- [j70]Khee Meng Koh, T. S. Ting, Z. L. Xu, Feng Ming Dong:
Lower bound on the weakly connected domination number of a cycle-disjoint graph. Australas. J Comb. 46: 157-166 (2010) - [j69]Feng Ming Dong, Khee Meng Koh:
On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs. SIAM J. Discret. Math. 24(2): 370-378 (2010)
2000 – 2009
- 2008
- [j68]Feng Ming Dong, Khee Meng Koh:
Bounds For The Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. 17(6): 749-759 (2008) - [j67]Feng Ming Dong, Khee Meng Koh:
Domination numbers and zeros of chromatic polynomials. Discret. Math. 308(10): 1930-1940 (2008) - [j66]Feng Ming Dong, Khee Meng Koh:
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. Discret. Math. 308(11): 2285-2287 (2008) - [j65]Khee Meng Koh, Chyan-Yee Goh, Feng Ming Dong:
The maximum number of maximal independent sets in unicyclic connected graphs. Discret. Math. 308(17): 3761-3769 (2008) - [j64]Feng Ming Dong, Khee Meng Koh:
On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). Discret. Math. 308(17): 3897-3905 (2008) - 2007
- [j63]Feng Ming Dong, Khee Meng Koh:
Bounds for the coefficients of flow polynomials. J. Comb. Theory B 97(3): 413-420 (2007) - 2006
- [j62]Khee Meng Koh, Eng Guan Tay:
On optimal orientations of tree vertex-multiplications. Australas. J Comb. 34: 69-88 (2006) - [j61]Goh Chee Ying, Khee Meng Koh, Bruce E. Sagan, Vincent R. Vatter:
Maximal independent sets in graphs with at most r cycles. J. Graph Theory 53(4): 270-282 (2006) - [j60]Feng Ming Dong, Khee Meng Koh:
On Graphs Having No Chromatic Zeros in (1, 2). SIAM J. Discret. Math. 20(3): 799-810 (2006) - 2005
- [j59]Khee Meng Koh, Kah Loon Ng:
The orientation number of two complete graphs with linkages. Discret. Math. 295(1-3): 91-106 (2005) - [j58]Kah Loon Ng, Khee Meng Koh:
On optimal orientation of cycle vertex multiplications. Discret. Math. 297(1-3): 104-118 (2005) - 2004
- [j57]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh:
Chromatically Unique Multibridge Graphs. Electron. J. Comb. 11(1) (2004) - [j56]Feng Ming Dong, Khee Meng Koh:
Two Results on Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. 13(6): 809-813 (2004) - [j55]Feng Ming Dong, Khee Meng Koh, C. A. Soh:
Divisibility of certain coefficients of the chromatic polynomials. Discret. Math. 275(1-3): 311-317 (2004) - [j54]Feng Ming Dong, Khee Meng Koh:
On upper bounds for real roots of chromatic polynomials. Discret. Math. 282(1-3): 95-101 (2004) - [j53]Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo:
On the number of quasi-kernels in digraphs. J. Graph Theory 46(1): 48-56 (2004) - 2003
- [j52]Khee Meng Koh, Bock Boom Lim, Peter J. Slater:
H-domination in graphs. Discret. Math. 272(1): 97-105 (2003) - 2002
- [j51]Feng Ming Dong, Kee L. Teo, Khee Meng Koh:
A note on the chromaticity of some 2-connected (n, n+3)-graphs. Discret. Math. 243(1-3): 217-221 (2002) - [j50]Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy:
Non-chordal graphs having integral-root chromatic polynomials II. Discret. Math. 245(1-3): 247-253 (2002) - [j49]Gregory Z. Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo:
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs. Graphs Comb. 18(3): 499-506 (2002) - [j48]Khee Meng Koh, Eng Guan Tay:
Optimal Orientations of Graphs and Digraphs: A Survey. Graphs Comb. 18(4): 745-756 (2002) - 2001
- [j47]Khee Meng Koh, Eng Guan Tay:
On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle. Discret. Math. 232(1-3): 153-161 (2001) - [j46]Khee Meng Koh, Eng Guan Tay:
On Optimal Orientations of Cartesian Products of Trees. Graphs Comb. 17(1): 79-97 (2001) - [j45]Feng Ming Dong, Khee Meng Koh, Kee L. Teo:
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. Graphs Comb. 17(4): 611-635 (2001) - [j44]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. J. Graph Theory 37(1): 48-77 (2001) - 2000
- [j43]Khee Meng Koh, Eng Guan Tay:
On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles. Discret. Math. 211: 75-102 (2000) - [j42]Khee Meng Koh, Eng Guan Tay:
On optimal orientations of G vertex-multiplications. Discret. Math. 219(1-3): 153-171 (2000) - [j41]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. Discret. Math. 222(1-3): 73-88 (2000) - [j40]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. Discret. Math. 224(1-3): 107-124 (2000)
1990 – 1999
- 1999
- [j39]Khee Meng Koh, Eng Guan Tay:
On Optimal Orientations of Cartesian Products with a Bipartite Graph. Discret. Appl. Math. 98(1-2): 103-120 (1999) - [j38]Feng Ming Dong, Khee Meng Koh:
Structures and chromaticity of some extremal 3-colourable graphs. Discret. Math. 203(1-3): 71-82 (1999) - 1998
- [j37]Khee Meng Koh, Eng Guan Tay:
On optimal orientations of cartesian products of graphs (I). Discret. Math. 190(1-3): 115-136 (1998) - [j36]Khee Meng Koh, Eng Guan Tay:
On optimal orientations of Cartesian products of even cycles. Networks 32(4): 299-306 (1998) - 1997
- [j35]C. C. Chen, G. P. Jin, Khee Meng Koh:
Triangle-Free Graphs with Large Degree. Comb. Probab. Comput. 6(4): 381-396 (1997) - [j34]Khee Meng Koh, Eng Guan Tay:
Optimal Orientations of Products of Paths and Cycles. Discret. Appl. Math. 78(1-3): 163-174 (1997) - [j33]Khee Meng Koh, B. P. Tan:
The number of kings in a multipartite tournament. Discret. Math. 167-168: 411-418 (1997) - [j32]Feng Ming Dong, Khee Meng Koh:
On graphs in which any pair of colour classes but one induces a tree. Discret. Math. 169(1-3): 39-54 (1997) - [j31]C. C. Chen, Gek Ling Chia, Khee Meng Koh, N. Z. Li, Kee L. Teo:
Preface. Discret. Math. 172(1-3): 1 (1997) - [j30]Khee Meng Koh, Kee L. Teo:
The search for chromatically unique graphs - II. Discret. Math. 172(1-3): 59-78 (1997) - [j29]Khee Meng Koh, B. P. Tan:
The diameter of an orientation of a complete multipartite graph [Discrete Math 149 (1996) 131-139]. Discret. Math. 173(1-3): 297-298 (1997) - [j28]Feng Ming Dong, Khee Meng Koh:
On the structure and chromaticity of graphs in which any two colour classes induce a tree. Discret. Math. 176(1-3): 97-113 (1997) - [j27]Khee Meng Koh, Eng Guan Tay:
On optimal orientations of Cartesian products of even cycles and paths. Networks 30(1): 1-7 (1997) - 1996
- [j26]Khee Meng Koh, B. P. Tan:
The diameter of an orientation of a complete multipartite graph. Discret. Math. 149(1-3): 131-139 (1996) - [j25]Khee Meng Koh, K. S. Poh:
On the lower length of the closed-set lattice of a tree. Discret. Math. 151(1-3): 121-130 (1996) - [j24]Khee Meng Koh, B. P. Tan:
Number of 4-kings in bipartite tournaments with no 3-kings. Discret. Math. 154(1-3): 281-287 (1996) - [j23]Khee Meng Koh, Chung-Piaw Teo:
Chromaticity of series-parallel graphs. Discret. Math. 154(1-3): 289-295 (1996) - [j22]Khee Meng Koh, B. P. Tan:
The minimum diameter of orientations of complete multipartite graphs. Graphs Comb. 12(1): 333-339 (1996) - 1995
- [j21]Khee Meng Koh, B. P. Tan:
Kings in multipartite tournaments. Discret. Math. 147(1-3): 171-183 (1995) - 1994
- [j20]Khee Meng Koh, Kee L. Teo:
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles. Discret. Math. 127(1-3): 243-258 (1994) - [j19]Chung-Piaw Teo, Khee Meng Koh:
On chromatic uniqueness of uniform subdivisions of graphs. Discret. Math. 128(1-3): 327-335 (1994) - 1993
- [j18]C. C. Chen, Khee Meng Koh, Y. H. Peng:
On the higher-order edge toughness of a graph. Discret. Math. 111(1-3): 113-123 (1993) - 1992
- [j17]Khee Meng Koh, K. S. Poh:
On the spectrum of the closed-set lattice of a graph. Australas. J Comb. 5: 253-260 (1992) - [j16]Chung-Piaw Teo, Khee Meng Koh:
The number of shortest cycles and the chromatic uniqueness of a graph. J. Graph Theory 16(1): 7-15 (1992) - 1991
- [j15]Khee Meng Koh, Chung-Piaw Teo:
The chromatic uniqueness of certain broken wheels. Discret. Math. 96(1): 65-69 (1991) - 1990
- [j14]Khee Meng Koh, B. H. Goh:
Two classes of chromatically unique graphs. Discret. Math. 82(1): 13-24 (1990) - [j13]Khee Meng Koh, Kee L. Teo:
The search for chromatically unique graphs. Graphs Comb. 6(3): 259-285 (1990) - [j12]Chung-Piaw Teo, Khee Meng Koh:
The chromaticity of complete bipartite graphs with at most one edge deleted. J. Graph Theory 14(1): 89-99 (1990)
1980 – 1989
- 1989
- [j11]Y. H. Peng, C. C. Chen, Khee Meng Koh:
On the factor-thickness of regular graphs. Graphs Comb. 5(1): 173-188 (1989) - [j10]Khee Meng Koh, Kee L. Teo:
The 2-hamiltonian cubes of graphs. J. Graph Theory 13(6): 737-747 (1989) - 1988
- [j9]Khee Meng Koh, K. S. Poh:
Products of graphs with their closed-set lattices. Discret. Math. 69(3): 241-251 (1988) - [j8]Khee Meng Koh, K. S. Poh:
Constructions of sensitive graphs which are not strongly sensitive. Discret. Math. 72(1-3): 225-236 (1988) - 1986
- [j7]Khee Meng Koh, K. S. Poh:
On the uniformity of the closed-set lattice of a tree. Discret. Math. 61(1): 61-70 (1986) - 1985
- [j6]Khee Meng Koh, K. S. Poh:
On a construction of critical graphs which are not sensitive. Graphs Comb. 1(1): 265-270 (1985) - 1984
- [j5]C. C. Chen, Khee Meng Koh, S. C. Lee:
On the grading numbers of direct products of chains. Discret. Math. 49(1): 21-26 (1984) - 1980
- [j4]Khee Meng Koh, Douglas G. Rogers, T. Tan:
Products of graceful trees. Discret. Math. 31(3): 279-292 (1980) - [j3]Charles Delorme, Maryvonne Mahéo, Henri Thuillier, Khee Meng Koh, H. K. Teo:
Cycles with a chord are graceful. J. Graph Theory 4(4): 409-415 (1980)
1970 – 1979
- 1979
- [j2]Khee Meng Koh, T. Tan, Douglas G. Rogers:
Two theorems on graceful trees. Discret. Math. 25(2): 141-148 (1979) - 1973
- [j1]C. C. Chen, Khee Meng Koh:
A characterization of finite distributive planar lattices. Discret. Math. 5(3): 207-213 (1973)
Coauthor Index
aka: Feng Ming Dong
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
