Feng Ming Dong

Publication Activity (10 Years)

Years Active: 1993-2015
Publications (10 Years): 0

Top Topics

Top Venues

Electron. J. Comb.

J. Graph Theory

J. Comb. Theory, Ser. B

Publications

Feng Ming Dong
On Graphs Having no Flow Roots in the Interval $(1, 2)$. Electron. J. Comb. 22 (1) (2015)
Feng Ming Dong
On zero-free intervals of flow polynomials. J. Comb. Theory, Ser. B 111 (2015)
Feng Ming Dong, Eng Guan Tay, Khee Meng Koh
Nowhere-zero 3-flows in Tensor Products of Graphs. Ars Comb. 117 (2014)
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) (2012)
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 (2012)
Feng Ming Dong
A new expression for matching polynomials. Discret. Math. 312 (4) (2012)
Feng Ming Dong, Bill Jackson
A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs. SIAM J. Discret. Math. 25 (3) (2011)
Feng Ming Dong, Gordon F. Royle, Dave Wagner
Chromatic Roots of a Ring of Four Cliques. Electron. J. Comb. 18 (1) (2011)
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 (2010)
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) (2010)
Feng Ming Dong, Khee Meng Koh
Domination numbers and zeros of chromatic polynomials. Discret. Math. 308 (10) (2008)
Feng Ming Dong, Khee Meng Koh
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. Discret. Math. 308 (11) (2008)
Feng Ming Dong, Khee Meng Koh
Bounds For The Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. 17 (6) (2008)
Khee Meng Koh, Chyan-Yee Goh, Feng Ming Dong
The maximum number of maximal independent sets in unicyclic connected graphs. Discret. Math. 308 (17) (2008)
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) (2008)
Feng Ming Dong, Khee Meng Koh
Bounds for the coefficients of flow polynomials. J. Comb. Theory, Ser. B 97 (3) (2007)
Feng Ming Dong, Khee Meng Koh
On Graphs Having No Chromatic Zeros in (1, 2). SIAM J. Discret. Math. 20 (3) (2006)
Feng Ming Dong
Further results on the lower bounds of mean color numbers. J. Graph Theory 48 (1) (2005)
Feng Ming Dong
The largest non-integer real zero of chromatic polynomials of graphs with fixed order. Discret. Math. 282 (1-3) (2004)
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
Graph-functions associated with an edge-property. Australas. J Comb. 30 (2004)
Feng Ming Dong, Khee Meng Koh
Two Results on Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. 13 (6) (2004)
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)
Feng Ming Dong, Khee Meng Koh
On upper bounds for real roots of chromatic polynomials. Discret. Math. 282 (1-3) (2004)
Feng Ming Dong, Khee Meng Koh, C. A. Soh
Divisibility of certain coefficients of the chromatic polynomials. Discret. Math. 275 (1-3) (2004)
Feng Ming Dong
Bounds for mean colour numbers of graphs. J. Comb. Theory, Ser. B 87 (2) (2003)
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) (2002)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Two invariants for adjointly equivalent graphs. Australas. J Comb. 25 (2002)
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
The vertex-cover polynomial of a graph. Discret. Math. 250 (1-3) (2002)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Chromaticity of some families of dense graphs. Discret. Math. 258 (1-3) (2002)
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
Zeros of adjoint polynomials of paths and cycles. Australas. J Comb. 25 (2002)
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) (2002)
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) (2001)
Feng Ming Dong, Khee Meng Koh, Kee L. Teo
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. Graphs Comb. 17 (4) (2001)
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) (2000)
Feng Ming Dong
Proof of a Chromatic Polynomial Conjecture. J. Comb. Theory, Ser. B 78 (1) (2000)
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) (2000)
Feng Ming Dong, Khee Meng Koh
Structures and chromaticity of some extremal 3-colourable graphs. Discret. Math. 203 (1-3) (1999)
Feng Ming Dong, Y. P. Liu
All wheels with two missing consecutive spokes are chromatically unique. Discret. Math. 184 (1-3) (1998)
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) (1997)
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) (1997)
Feng Ming Dong, Y. P. Liu
. Graphs Comb. 12 (1) (1996)
Feng Ming Dong, Yanpei Liu
. Discret. Math. 145 (1-3) (1995)
Feng Ming Dong, Yanpei Liu
Counting rooted near-triangulations on the sphere. Discret. Math. 123 (1-3) (1993)
Feng Ming Dong
On chromatic uniqueness of two infinite families of graphs. J. Graph Theory 17 (3) (1993)