The SCEAS System
| |||||||

## Search the dblp DataBase
Khee Meng Koh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
**Chromatically Unique Multibridge Graphs.**[Citation Graph (0, 0)][DBLP] Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal] - Feng Ming Dong, Khee Meng Koh
**Two Results on Real Zeros of Chromatic Polynomials.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2004, v:37, n:6, pp:809-813 [Journal] - Khee Meng Koh, Eng Guan Tay
**Optimal Orientations of Products of Paths and Cycles.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:78, n:1-3, pp:163-174 [Journal] - Khee Meng Koh, Eng Guan Tay
**On Optimal Orientations of Cartesian Products with a Bipartite Graph.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:103-120 [Journal] - Feng Ming Dong, Khee Meng Koh
**On upper bounds for real roots of chromatic polynomials.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:282, n:1-3, pp:95-101 [Journal] - Feng Ming Dong, Khee Meng Koh, C. A. Soh
**Divisibility of certain coefficients of the chromatic polynomials.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:275, n:1-3, pp:311-317 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:224, n:1-3, pp:107-124 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:222, n:1-3, pp:73-88 [Journal] - Feng Ming Dong, Kee L. Teo, Khee Meng Koh
**A note on the chromaticity of some 2-connected (n, n+3)-graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:243, n:1-3, pp:217-221 [Journal] - Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
**Non-chordal graphs having integral-root chromatic polynomials II.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:245, n:1-3, pp:247-253 [Journal] - Khee Meng Koh, Bock Boom Lim, Peter J. Slater
[Citation Graph (0, 0)][DBLP]*H*-domination in graphs. Discrete Mathematics, 2003, v:272, n:1, pp:97-105 [Journal] - Khee Meng Koh, K. L. Ng
**The orientation number of two complete graphs with linkages.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:295, n:1-3, pp:91-106 [Journal] - Khee Meng Koh, Eng Guan Tay
**On optimal orientations of**[Citation Graph (0, 0)][DBLP]*G*vertex-multiplications. Discrete Mathematics, 2000, v:219, n:1-3, pp:153-171 [Journal] - Khee Meng Koh, Eng Guan Tay
**On optimal orientations of cartesian products of graphs (ii): complete graphs and even cycles.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:211, n:, pp:75-102 [Journal] - Khee Meng Koh, Eng Guan Tay
**On a conjecture concerning optimal orientations of the cartesian product of a triangle and an odd cycle.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:232, n:1-3, pp:153-161 [Journal] - Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
**Almost Minimum Diameter Orientations of Semicomplete Multipartite and Extended Digraphs.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2002, v:18, n:3, pp:499-506 [Journal] - Khee Meng Koh, Eng Guan Tay
**On Optimal Orientations of Cartesian Products of Trees.**[Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2001, v:17, n:1, pp:79-97 [Journal] - Khee Meng Koh, Eng Guan Tay
**On optimal orientations of Cartesian products of even cycles and paths.**[Citation Graph (0, 0)][DBLP] Networks, 1997, v:30, n:1, pp:1-7 [Journal] - Khee Meng Koh, Eng Guan Tay
**On optimal orientations of Cartesian products of even cycles.**[Citation Graph (0, 0)][DBLP] Networks, 1998, v:32, n:4, pp:299-306 [Journal] - Gregory Gutin, Khee Meng Koh, Eng Guan Tay, Anders Yeo
**On the number of quasi-kernels in digraphs.**[Citation Graph (0, 0)][DBLP] Journal of Graph Theory, 2004, v:46, n:1, pp:48-56 [Journal] - F. M. Dong, K. M. Koh
**Structures and chromaticity of some extremal 3-colourable graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:203, n:1-3, pp:71-82 [Journal] - F. M. Dong, K. M. Koh
**On the structure and chromaticity of graphs in which any two colour classes induce a tree.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:176, n:1-3, pp:97-113 [Journal] - F. M. Dong, K. M. Koh
**On graphs in which any pair of colour classes but one induces a tree.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:169, n:1-3, pp:39-54 [Journal] **Bounds For The Real Zeros of Chromatic Polynomials.**[Citation Graph (, )][DBLP]**On planar and non-planar graphs having no chromatic zeros in the interval (1, 2).**[Citation Graph (, )][DBLP]**The maximum number of maximal independent sets in unicyclic connected graphs.**[Citation Graph (, )][DBLP]**A maximal zero-free interval for chromatic polynomials of bipartite planar graphs.**[Citation Graph (, )][DBLP]**Domination numbers and zeros of chromatic polynomials.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |