Khee Meng Koh
Affiliations:- National University of Singapore, Department of Mathematics, Singapore
- Nanyang University, Singapore
According to our database1,
Khee Meng Koh
authored at least 87 papers
between 1973 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1975
1980
1985
1990
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
10
1
1
4
3
5
2
2
5
1
3
2
5
1
4
4
4
2
2
9
5
1
2
1
2
1
3
2
2
1
1
1
2
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on nus.edu.sg
On csauthors.net:
Bibliography
2024
WorldScientific, ISBN: 9789811284830, 2024
2019
AKCE Int. J. Graphs Comb., 2019
2016
2015
Electron. Notes Discret. Math., 2015
Electron. Notes Discret. Math., 2015
2014
Nowhere-zero 3-flows in Tensor Products of Graphs.
Ars Comb., 2014
2013
Graphs Comb., 2013
Graphs Comb., 2013
Reversing arcs in transitive tournaments to obtain maximum number of spanning cycles.
Ars Comb., 2013
Max-min total restrained domination number.
Ars Comb., 2013
On the total restrained domination edge critical graphs.
Ars Comb., 2013
2012
The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial.
J. Graph Theory, 2012
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set.
Australas. J Comb., 2012
2010
On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs.
SIAM J. Discret. Math., 2010
Australas. J Comb., 2010
2008
Discret. Math., 2008
Discret. Math., 2008
Discret. Math., 2008
2007
2006
J. Graph Theory, 2006
2005
2004
Discret. Math., 2004
2003
2002
Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs.
Graphs Comb., 2002
Discret. Math., 2002
2001
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs.
J. Graph Theory, 2001
Graphs Comb., 2001
On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle.
Discret. Math., 2001
2000
On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles.
Discret. Math., 2000
Discret. Math., 2000
Discret. Math., 2000
1999
Discret. Math., 1999
Discret. Appl. Math., 1999
1998
1997
Networks, 1997
The diameter of an orientation of a complete multipartite graph [Discrete Math 149 (1996) 131-139].
Discret. Math., 1997
Discret. Math., 1997
On the structure and chromaticity of graphs in which any two colour classes induce a tree.
Discret. Math., 1997
1996
Graphs Comb., 1996
Discret. Math., 1996
1995
1994
Discret. Math., 1994
1993
1992
J. Graph Theory, 1992
1991
1990
J. Graph Theory, 1990
1989
1988
Discret. Math., 1988
1986
1985
1984
1980
1979
1973