Feng Ming Dong

Feng Ming Dong, Khee Meng Koh: The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial. Journal of Graph Theory 70(3): 262-283 (2012)

Feng Ming Dong, Khee Meng Koh: On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs. SIAM J. Discrete Math. 24(2): 370-378 (2010)

Feng Ming Dong, Khee Meng Koh: Bounds For The Real Zeros of Chromatic Polynomials. Combinatorics, Probability & Computing 17(6): 749-759 (2008)

Feng Ming Dong, Khee Meng Koh: Domination numbers and zeros of chromatic polynomials. Discrete Mathematics 308(10): 1930-1940 (2008)

Feng Ming Dong, Khee Meng Koh: A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. Discrete Mathematics 308(11): 2285-2287 (2008)

Khee Meng Koh, Chyan-Yee Goh, Feng Ming Dong: The maximum number of maximal independent sets in unicyclic connected graphs. Discrete Mathematics 308(17): 3761-3769 (2008)

Feng Ming Dong, Khee Meng Koh: On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). Discrete Mathematics 308(17): 3897-3905 (2008)

Feng Ming Dong, Khee Meng Koh: Bounds for the coefficients of flow polynomials. J. Comb. Theory, Ser. B 97(3): 413-420 (2007)

Feng Ming Dong, Khee Meng Koh: On Graphs Having No Chromatic Zeros in (1, 2). SIAM J. Discrete Math. 20(3): 799-810 (2006)

Feng Ming Dong: Further results on the lower bounds of mean color numbers. Journal of Graph Theory 48(1): 51-73 (2005)

Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh: Chromatically Unique Multibridge Graphs. Electr. J. Comb. 11(1) (2004)

Feng Ming Dong, Khee Meng Koh: Two Results on Real Zeros of Chromatic Polynomials. Combinatorics, Probability & Computing 13(6): 809-813 (2004)

Feng Ming Dong, Khee Meng Koh, C. A. Soh: Divisibility of certain coefficients of the chromatic polynomials. Discrete Mathematics 275(1-3): 311-317 (2004)

Feng Ming Dong, Khee Meng Koh: On upper bounds for real roots of chromatic polynomials. Discrete Mathematics 282(1-3): 95-101 (2004)

Feng Ming Dong: The largest non-integer real zero of chromatic polynomials of graphs with fixed order. Discrete Mathematics 282(1-3): 103-112 (2004)

Feng Ming Dong: Bounds for mean colour numbers of graphs. J. Comb. Theory, Ser. B 87(2): 348-365 (2003)

Feng Ming Dong, Kee L. Teo, Khee Meng Koh: A note on the chromaticity of some 2-connected (n, n+3)-graphs. Discrete Mathematics 243(1-3): 217-221 (2002)

Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy: Non-chordal graphs having integral-root chromatic polynomials II. Discrete Mathematics 245(1-3): 247-253 (2002)

Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little: The vertex-cover polynomial of a graph. Discrete Mathematics 250(1-3): 71-78 (2002)

Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy: Chromaticity of some families of dense graphs. Discrete Mathematics 258(1-3): 303-321 (2002)

Feng Ming Dong, Khee Meng Koh, Kee L. Teo: Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. Graphs and Combinatorics 17(4): 611-635 (2001)

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. Journal of Graph Theory 37(1): 48-77 (2001)

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. Discrete Mathematics 222(1-3): 73-88 (2000)

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. Discrete Mathematics 224(1-3): 107-124 (2000)

Feng Ming Dong: Proof of a Chromatic Polynomial Conjecture. J. Comb. Theory, Ser. B 78(1): 35-44 (2000)

Feng Ming Dong, Khee Meng Koh: Structures and chromaticity of some extremal 3-colourable graphs. Discrete Mathematics 203(1-3): 71-82 (1999)

Feng Ming Dong, Khee Meng Koh: On graphs in which any pair of colour classes but one induces a tree. Discrete Mathematics 169(1-3): 39-54 (1997)

Feng Ming Dong, Khee Meng Koh: On the structure and chromaticity of graphs in which any two colour classes induce a tree. Discrete Mathematics 176(1-3): 97-113 (1997)

Feng Ming Dong, Yanpei Liu: On the chromatic uniqueness of the graph W(n, n-2) + K_k. Discrete Mathematics 145(1-3): 95-103 (1995)

Feng Ming Dong, Yanpei Liu: Counting rooted near-triangulations on the sphere. Discrete Mathematics 123(1-3): 35-45 (1993)

Feng Ming Dong: On chromatic uniqueness of two infinite families of graphs. Journal of Graph Theory 17(3): 387-392 (1993)