Feng Ming Dong

44 papers Journal 44

Year	Rank	Type	Title / Venue / Authors
2015	J	`jnl`	On Graphs Having no Flow Roots in the Interval $(1, 2)$. Electron. J. Comb. Feng Ming Dong
2015	J	`jnl`	On zero-free intervals of flow polynomials. J. Comb. Theory B Feng Ming Dong
2014	J	`jnl`	Nowhere-zero 3-flows in Tensor Products of Graphs. Ars Comb. Feng Ming Dong, Eng Guan Tay, Khee Meng Koh
2012	J	`jnl`	A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set. Australas. J Comb. Khee Meng Koh, T. S. Ting, Feng Ming Dong
2012	J	`jnl`	A new expression for matching polynomials. Discret. Math. Feng Ming Dong
2012	J	`jnl`	The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial. J. Graph Theory Feng Ming Dong, Khee Meng Koh
2011	J	`jnl`	A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs. SIAM J. Discret. Math. Feng Ming Dong, Bill Jackson
2011	J	`jnl`	Chromatic Roots of a Ring of Four Cliques. Electron. J. Comb. Feng Ming Dong, Gordon F. Royle, Dave Wagner
2010	J	`jnl`	Lower bound on the weakly connected domination number of a cycle-disjoint graph. Australas. J Comb. Khee Meng Koh, T. S. Ting, Z. L. Xu, Feng Ming Dong
2010	J	`jnl`	On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs. SIAM J. Discret. Math. Feng Ming Dong, Khee Meng Koh
2008	J	`jnl`	A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. Discret. Math. Feng Ming Dong, Khee Meng Koh
2008	J	`jnl`	Bounds For The Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. Feng Ming Dong, Khee Meng Koh
2008	J	`jnl`	Domination numbers and zeros of chromatic polynomials. Discret. Math. Feng Ming Dong, Khee Meng Koh
2008	J	`jnl`	On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). Discret. Math. Feng Ming Dong, Khee Meng Koh
2008	J	`jnl`	The maximum number of maximal independent sets in unicyclic connected graphs. Discret. Math. Khee Meng Koh, Chyan-Yee Goh, Feng Ming Dong
2007	J	`jnl`	Bounds for the coefficients of flow polynomials. J. Comb. Theory B Feng Ming Dong, Khee Meng Koh
2006	J	`jnl`	On Graphs Having No Chromatic Zeros in (1, 2). SIAM J. Discret. Math. Feng Ming Dong, Khee Meng Koh
2005	J	`jnl`	Further results on the lower bounds of mean color numbers. J. Graph Theory Feng Ming Dong
2004	J	`jnl`	Chromatically Unique Multibridge Graphs. Electron. J. Comb. Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
2004	J	`jnl`	Divisibility of certain coefficients of the chromatic polynomials. Discret. Math. Feng Ming Dong, Khee Meng Koh, C. A. Soh
2004	J	`jnl`	Graph-functions associated with an edge-property. Australas. J Comb. Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
2004	J	`jnl`	On upper bounds for real roots of chromatic polynomials. Discret. Math. Feng Ming Dong, Khee Meng Koh
2004	J	`jnl`	The largest non-integer real zero of chromatic polynomials of graphs with fixed order. Discret. Math. Feng Ming Dong
2004	J	`jnl`	Two Results on Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. Feng Ming Dong, Khee Meng Koh
2003	J	`jnl`	Bounds for mean colour numbers of graphs. J. Comb. Theory B Feng Ming Dong
2002	J	`jnl`	A note on the chromaticity of some 2-connected (n, n+3)-graphs. Discret. Math. Feng Ming Dong, Kee L. Teo, Khee Meng Koh
2002	J	`jnl`	Chromaticity of some families of dense graphs. Discret. Math. Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2002	J	`jnl`	Non-chordal graphs having integral-root chromatic polynomials II. Discret. Math. Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
2002	J	`jnl`	The vertex-cover polynomial of a graph. Discret. Math. Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
2002	J	`jnl`	Two invariants for adjointly equivalent graphs. Australas. J Comb. Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2002	J	`jnl`	Zeros of adjoint polynomials of paths and cycles. Australas. J Comb. Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2001	J	`jnl`	Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. J. Graph Theory Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy
2001	J	`jnl`	Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. Graphs Comb. Feng Ming Dong, Khee Meng Koh, Kee L. Teo
2000	J	`jnl`	An attempt to classify bipartite graphs by chromatic polynomials. Discret. Math. Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2000	J	`jnl`	Chromatically unique bipartite graphs with low 3-independent partition numbers. Discret. Math. Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2000	J	`jnl`	Proof of a Chromatic Polynomial Conjecture. J. Comb. Theory B Feng Ming Dong
1999	J	`jnl`	Structures and chromaticity of some extremal 3-colourable graphs. Discret. Math. Feng Ming Dong, Khee Meng Koh
1998	J	`jnl`	All wheels with two missing consecutive spokes are chromatically unique. Discret. Math. Feng Ming Dong, Y. P. Liu
1997	J	`jnl`	On graphs in which any pair of colour classes but one induces a tree. Discret. Math. Feng Ming Dong, Khee Meng Koh
1997	J	`jnl`	On the structure and chromaticity of graphs in which any two colour classes induce a tree. Discret. Math. Feng Ming Dong, Khee Meng Koh
1996	J	`jnl`	On the chromatic uniqueness of the graph Graphs Comb. Feng Ming Dong, Y. P. Liu
1995	J	`jnl`	On the chromatic uniqueness of the graph W(n, n-2) + K Discret. Math. Feng Ming Dong, Yanpei Liu
1993	J	`jnl`	Counting rooted near-triangulations on the sphere. Discret. Math. Feng Ming Dong, Yanpei Liu
1993	J	`jnl`	On chromatic uniqueness of two infinite families of graphs. J. Graph Theory Feng Ming Dong