Khee Meng Koh

发表

Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2001, J. Graph Theory.

Chromatically unique bipartite graphs with low 3-independent partition numbers

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2000, Discret. Math..

Max-min total restrained domination number

Khee Meng Koh, Behnaz Omoomi, Zeinab Maleki, 2013, Ars Comb..

On planar and non-planar graphs having no chromatic zeros in the interval (1, 2)

Feng Ming Dong, Khee Meng Koh, 2008, Discret. Math..

On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles

Eng Guan Tay, Khee Meng Koh, E. G. Tay, 2000, Discret. Math..

H-domination in graphs

Peter J. Slater, Khee Meng Koh, Bock Boom Lim, 2003, Discret. Math..

Optimal Orientations of Products of Paths and Cycles

Eng Guan Tay, Khee Meng Koh, E. G. Tay, 1997, Discret. Appl. Math..

On Optimal Orientations of Cartesian Products with a Bipartite Graph

Eng Guan Tay, Khee Meng Koh, E. G. Tay, 1999, Discret. Appl. Math..

Maximal independent sets in graphs with at most r cycles

Bruce E. Sagan, Khee Meng Koh, Vincent Vatter, 2006, J. Graph Theory.

Independence, Matching and Covering

Eng Guan Tay, Fengming Dong, Khee Meng Koh, 2015 .

Chromatically Unique Multibridge Graphs

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2004, Electron. J. Comb..

Two Results on Real Zeros of Chromatic Polynomials

Feng Ming Dong, Khee Meng Koh, 2004, Comb. Probab. Comput..

Lower bound on the weakly connected domination number of a cycle-disjoint graph

Feng Ming Dong, Khee Meng Koh, T. S. Ting, 2010, Australas. J Comb..

Bounds for the coefficients of flow polynomials

Feng Ming Dong, Khee Meng Koh, 2007, J. Comb. Theory, Ser. B.

Domination numbers and zeros of chromatic polynomials

Feng Ming Dong, Khee Meng Koh, 2008, Discret. Math..

An Upper Bound for the Total Restrained Domination Number of Graphs

Khee Meng Koh, Behnaz Omoomi, Zeinab Maleki, 2013, Graphs Comb..

Distribution of Distinct Objects into Distinct Boxes

Eng Guan Tay, Khee Meng Koh, 2002 .

On Optimal Orientations of Cartesian Products of Trees

Eng Guan Tay, Khee Meng Koh, E. G. Tay, 2001, Graphs Comb..

On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle

Eng Guan Tay, Khee Meng Koh, E. G. Tay, 2001, Discret. Math..

Bounds For The Real Zeros of Chromatic Polynomials

Feng Ming Dong, Khee Meng Koh, K. Koh, 2008, Combinatorics, Probability and Computing.

Structures and chromaticity of some extremal 3-colourable graphs

Feng Ming Dong, Khee Meng Koh, 1999, Discret. Math..

On optimal orientations of Cartesian products of even cycles and paths

Eng Guan Tay, Khee Meng Koh, 1997, Networks.

On optimal orientations of tree vertex-multiplications

Eng Guan Tay, Khee Meng Koh, 2006, Australas. J Comb..

A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set

Feng Ming Dong, Khee Meng Koh, T. S. Ting, 2012, Australas. J Comb..

On optimal orientations of Cartesian products of even cycles

Eng Guan Tay, Khee Meng Koh, 1998, Networks.

On graphs in which any pair of colour classes but one induces a tree

Feng Ming Dong, Khee Meng Koh, K. Koh, 1997, Discret. Math..

On the number of quasi‐kernels in digraphs

Eng Guan Tay, Gregory Gutin, Anders Yeo, 2001, J. Graph Theory.

Graph Theory: Undergraduate Mathematics

Fengming Dong, Eng Guan Tay, Khee Meng Koh, 2015 .

The maximum number of maximal independent sets in unicyclic connected graphs

Feng Ming Dong, Khee Meng Koh, Chyan-Yee Goh, 2008, Discret. Math..

Graph Isomorphisms, Subgraphs, the Complement of a Graph and Graphic Sequences

Eng Guan Tay, Fengming Dong, Khee Meng Koh, 2015 .

Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs

Eng Guan Tay, Gregory Gutin, Anders Yeo, 2002, Graphs Comb..

Non-chordal graphs having integral-root chromatic polynomials II

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, 2002, Discret. Math..

Preface

Khee Meng Koh, Kee L. Teo, G. L. Chia, 1997, Discret. Math..

On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs

Feng Ming Dong, Khee Meng Koh, 2010, SIAM J. Discret. Math..

Counting the Number of Minimum Roman Dominating Functions of a Graph pdf

Zheng Shi, Khee Meng Koh, 2014, ArXiv.

A note on the chromaticity of some 2-connected (n, n+3)-graphs

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, 2002, Discret. Math..

Nowhere-zero 3-flows in Tensor Products of Graphs

Eng Guan Tay, Feng Ming Dong, Khee Meng Koh, 2014, Ars Comb..

An attempt to classify bipartite graphs by chromatic polynomials

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2000, Discret. Math..

Hamiltonian Graphs and The Traveling Salesman Problem

Eng Guan Tay, Fengming Dong, Khee Meng Koh, 2015 .

On the structure and chromaticity of graphs in which any two colour classes induce a tree

Feng Ming Dong, Khee Meng Koh, K. Koh, 1997, Discret. Math..

On optimal orientations of G vertex-multiplications

Eng Guan Tay, Khee Meng Koh, E. G. Tay, 2000, Discret. Math..

The orientation number of two complete graphs with linkages

Khee Meng Koh, K. L. Ng, Kah Loon Ng, 2005, Discret. Math..

On upper bounds for real roots of chromatic polynomials

Feng Ming Dong, Khee Meng Koh, K. Koh, 2004, Discret. Math..

Solutions to Miscellaneous Problems

Eng Guan Tay, Khee Meng Koh, 2006 .

The Nk-valued Roman Domination and Its Boundaries

Khee Meng Koh, Andreas Dwi Maryanto Gunawan, 2015, Electron. Notes Discret. Math..

Divisibility of certain coefficients of the chromatic polynomials

Feng Ming Dong, Khee Meng Koh, C. A. Soh, 2004, Discret. Math..

The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial

Feng Ming Dong, Khee Meng Koh, 2012, J. Graph Theory.

On the total restrained domination edge critical graphs

Khee Meng Koh, Behnaz Omoomi, Zeinab Maleki, 2013, Ars Comb..

Graph Theory Singapore 1983

Hian Poh Yap, Khee Meng Koh, 1984 .

A maximal zero-free interval for chromatic polynomials of bipartite planar graphs

Feng Ming Dong, Khee Meng Koh, 2008, Discret. Math..

Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, 2001, Graphs Comb..

On optimal orientations of Cartesian products of even cycles

Eng Guan Tay, Khee Meng Koh, 1998 .

On the lattice of maximum-sized antichains of a finite poset

Khee Meng Koh, 1983 .

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs

Kok Lay Teo, Fengming Dong, Charles H. C. Little, 2001 .

On the sublattice-lattice of a lattice

Kok Lay Teo, C. C. Chen, Khee Meng Koh, 1984 .

On the length of the lattice of sublattices of a finite distributive lattice

Khee Meng Koh, C. C. Chen, 1982 .

On an isomorphism problem on the closed-set lattice of a graph

Khee Meng Koh, K. S. Poh, 1985 .

The Stirling Numbers of the First Kind

Eng Guan Tay, Khee Meng Koh, E. G. Tay, 2006 .

On the Frattini sublattice of a lattice

Khee Meng Koh, 1971 .

On the Sequence of Closed‐Set Lattices of a Graph

Khee Meng Koh, K. S. Poh, 1989 .

On optimal orientations of Cartesian products of even cycles and paths

Eng Guan Tay, Khee Meng Koh, E. G. Tay, 1997, Networks.

On the purity of the lattice of sublattices of a finite distributive lattice

Khee Meng Koh, C. C. Chen, Sung chul Lee, 1982 .