Counting rooted near-triangulations on the sphere. - Feng Ming Dong; Yanpei Liu (Discret. Math., 1993)

On chromatic uniqueness of two infinite families of graphs. - Feng Ming Dong (J. Graph Theory, 1993)

On the chromatic uniqueness of the graph W(n, n-2) + Kk. - Feng Ming Dong; Yanpei Liu (Discret. Math., 1995)

On the chromatic uniqueness of the graphW(n, n - 2, k). - Feng Ming Dong; Y. P. Liu (Graphs Comb., 1996)

On the structure and chromaticity of graphs in which any two colour classes induce a tree. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 1997)

On graphs in which any pair of colour classes but one induces a tree. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 1997)

All wheels with two missing consecutive spokes are chromatically unique. - Feng Ming Dong; Y. P. Liu (Discret. Math., 1998)

Structures and chromaticity of some extremal 3-colourable graphs. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 1999)

Chromatically unique bipartite graphs with low 3-independent partition numbers. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Discret. Math., 2000)

An attempt to classify bipartite graphs by chromatic polynomials. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Discret. Math., 2000)

Proof of a Chromatic Polynomial Conjecture. - Feng Ming Dong (J. Comb. Theory B, 2000)

Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo (Graphs Comb., 2001)

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. - Feng Ming Dong; Khee Meng Koh; Kee L. Teo; C. H. C. Little; Michael D. Hendy (J. Graph Theory, 2001)

Two invariants for adjointly equivalent graphs. - Feng Ming Dong; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Australas. J Comb., 2002)

Zeros of adjoint polynomials of paths and cycles. - Feng Ming Dong; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Australas. J Comb., 2002)

The vertex-cover polynomial of a graph. - Feng Ming Dong; Michael D. Hendy; Kee L. Teo; Charles H. C. Little (Discret. Math., 2002)

A note on the chromaticity of some 2-connected (n, n+3)-graphs. - Feng Ming Dong; Kee L. Teo; Khee Meng Koh (Discret. Math., 2002)

Non-chordal graphs having integral-root chromatic polynomials II. - Feng Ming Dong; Kee L. Teo; Khee Meng Koh; Michael D. Hendy (Discret. Math., 2002)

Chromaticity of some families of dense graphs. - Feng Ming Dong; Kee L. Teo; Charles H. C. Little; Michael D. Hendy (Discret. Math., 2002)

Bounds for mean colour numbers of graphs. - Feng Ming Dong (J. Comb. Theory B, 2003)

Graph-functions associated with an edge-property. - Feng Ming Dong; Michael D. Hendy; Kee L. Teo; Charles H. C. Little (Australas. J Comb., 2004)

Chromatically Unique Multibridge Graphs. - Feng Ming Dong; Kee L. Teo; Charles H. C. Little; Michael D. Hendy; Khee Meng Koh (Electron. J. Comb., 2004)

Two Results on Real Zeros of Chromatic Polynomials. - Feng Ming Dong; Khee Meng Koh (Comb. Probab. Comput., 2004)

The largest non-integer real zero of chromatic polynomials of graphs with fixed order. - Feng Ming Dong (Discret. Math., 2004)

On upper bounds for real roots of chromatic polynomials. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 2004)

Divisibility of certain coefficients of the chromatic polynomials. - Feng Ming Dong; Khee Meng Koh; C. A. Soh (Discret. Math., 2004)

Further results on the lower bounds of mean color numbers. - Feng Ming Dong (J. Graph Theory, 2005)

On Graphs Having No Chromatic Zeros in (1, 2). - Feng Ming Dong; Khee Meng Koh (SIAM J. Discret. Math., 2006)

Bounds for the coefficients of flow polynomials. - Feng Ming Dong; Khee Meng Koh (J. Comb. Theory B, 2007)

Bounds For The Real Zeros of Chromatic Polynomials. - Feng Ming Dong; Khee Meng Koh (Comb. Probab. Comput., 2008)

Domination numbers and zeros of chromatic polynomials. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 2008)

A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. - Feng Ming Dong; Khee Meng Koh (Discret. Math., 2008)

On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). - Feng Ming Dong; Khee Meng Koh (Discret. Math., 2008)

The maximum number of maximal independent sets in unicyclic connected graphs. - Khee Meng Koh; Chyan-Yee Goh; Feng Ming Dong (Discret. Math., 2008)

On graphs determining links with maximal number of components via medial construction. - Xian'an Jin; Fengming Dong; Eng Guan Tay (Discret. Appl. Math., 2009)

Lower bound on the weakly connected domination number of a cycle-disjoint graph. - Khee Meng Koh; T. S. Ting; Z. L. Xu; Feng Ming Dong (Australas. J Comb., 2010)

Zeros of the Jones Polynomial are Dense in the Complex Plane. - Xian'an Jin; Fuji Zhang; Fengming Dong; Eng Guan Tay (Electron. J. Comb., 2010)

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

Chromatic Roots of a Ring of Four Cliques. - Feng Ming Dong; Gordon F. Royle; Dave Wagner (Electron. J. Comb., 2011)

On atom-bond connectivity index of connected graphs. - Rundan Xing; Bo Zhou 007; Fengming Dong (Discret. Appl. Math., 2011)

A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs. - Feng Ming Dong; Bill Jackson (SIAM J. Discret. Math., 2011)

A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set. - Khee Meng Koh; T. S. Ting; Feng Ming Dong (Australas. J Comb., 2012)

A new expression for matching polynomials. - Feng Ming Dong (Discret. Math., 2012)

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

On the number of perfect matchings of line graphs. - Fengming Dong; Weigen Yan; Fuji Zhang (Discret. Appl. Math., 2013)

Nowhere-zero 3-flows in Tensor Products of Graphs. - Feng Ming Dong; Eng Guan Tay; Khee Meng Koh (Ars Comb., 2014)

On Graphs Having no Flow Roots in the Interval $(1, 2)$. - Feng Ming Dong (Electron. J. Comb., 2015)

Zeros of Jones Polynomials of Graphs. - Fengming Dong; Xian'an Jin (Electron. J. Comb., 2015)

The chromatic equivalence class of K1, n, n+2. - Boon Leong Ng; Fengming Dong (Discret. Math., 2015)

On zero-free intervals of flow polynomials. - Feng Ming Dong (J. Comb. Theory B, 2015)

Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs. - Ruixue Zhang; Fengming Dong (Eur. J. Comb., 2017)

Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs. - Fengming Dong; Weigen Yan (J. Graph Theory, 2017)

Even Subgraph Expansions for the Flow Polynomial of Planar Graphs with Maximum Degree at Most 4. - Qingying Deng; Xian'an Jin; Fengming Dong; Eng Guan Tay (Electron. J. Comb., 2018)

On Graphs whose Flow Polynomials have Real Roots Only. - Fengming Dong (Electron. J. Comb., 2018)

From G-parking functions to B-parking functions. - Fengming Dong (J. Comb. Theory A, 2018)

On the skewness of Cartesian products with trees. - Zhangdong Ouyang; Fengming Dong; Eng Guan Tay (Discret. Appl. Math., 2019)

A survey on the study of real zeros of flow polynomials. - Fengming Dong (J. Graph Theory, 2019)

Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. - Jun Ge; Fengming Dong (Discret. Appl. Math., 2020)

Zero-free intervals of chromatic polynomials of hypergraphs. - Ruixue Zhang; Fengming Dong (Discret. Math., 2020)

Problems on chromatic polynomials of hypergraphs. - Ruixue Zhang; Fengming Dong (Electron. J. Graph Theory Appl., 2020)

New expressions for order polynomials and chromatic polynomials. - Fengming Dong (J. Graph Theory, 2020)

On nonfeasible edge sets in matching-covered graphs. - Xiao Zhao; Fengming Dong; Sheng Chen 007 (J. Graph Theory, 2020)

On the Sizes of Bipartite 1-Planar Graphs. - Yuanqiu Huang; Zhangdong Ouyang; Fengming Dong (Electron. J. Comb., 2021)

Upper bounds on the signed edge domination number of a graph. - Fengming Dong; Jun Ge; Yan Yang (Discret. Math., 2021)

The Maximal 1-Planarity and Crossing Numbers of Graphs. - Zhangdong Ouyang; Yuanqiu Huang; Fengming Dong (Graphs Comb., 2021)

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations. - Fengming Dong; Jun Ge; Helin Gong; Bo Ning 001; Zhangdong Ouyang; Eng Guan Tay (J. Graph Theory, 2021)

Zip product of graphs and crossing numbers. - Zhangdong Ouyang; Yuanqiu Huang; Fengming Dong; Eng Guan Tay (J. Graph Theory, 2021)

DP color functions versus chromatic polynomials. - Fengming Dong; Yan Yang (Adv. Appl. Math., 2022)

Express the number of spanning trees in term of degrees. - Fengming Dong; Jun Ge; Zhangdong Ouyang (Appl. Math. Comput., 2022)

New upper bounds for the crossing numbers of crossing-critical graphs. - Zongpeng Ding; Zhangdong Ouyang; Yuanqiu Huang; Fengming Dong (Discret. Math., 2022)

Anti-Ramsey numbers for trees in complete multi-partite graphs. - Meiqiao Zhang; Fengming Dong (Discret. Math., 2022)

Counting spanning trees in a complete bipartite graph which contain a given spanning forest. - Fengming Dong; Jun Ge (J. Graph Theory, 2022)

On the Size of Matchings in 1-Planar Graph with High Minimum Degree. - Yuanqiu Huang; Zhangdong Ouyang; Fengming Dong (SIAM J. Discret. Math., 2022)

Proving identities on weight polynomials of tiered trees via Tutte polynomials. - Fengming Dong; Sherry H. F. Yan (J. Comb. Theory A, 2023)

An improved lower bound of P(G,L)-P(G,k) for k-assignments L. - Fengming Dong; Meiqiao Zhang (J. Comb. Theory B, 2023)

DP color functions versus chromatic polynomials (II). - Meiqiao Zhang; Fengming Dong (J. Graph Theory, 2023)

ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2-(n+3)∕2 ${n}^{2}-(n+3) unicode{x02215}2$. - Meiqiao Zhang; Fengming Dong (J. Graph Theory, 2023)

Introduction to Graph Theory - With Solutions to Selected Problems - Khee Meng Koh; Fengming Dong; Eng Guan Tay (Introduction to Graph Theory, 2024)

A new note on 1-planar graphs with minimum degree 7. - Yuanqiu Huang; Licheng Zhang; Fengming Dong (Discret. Appl. Math., 2024)

The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions. - Meiqiao Zhang; Fengming Dong (Discret. Math., 2024)

On the maximum local mean order of sub-k $k$-trees of a k $k$-tree. - Zhuo Li; Tianlong Ma; Fengming Dong; Xian'an Jin (J. Graph Theory, 2024)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (II). - Meiqiao Zhang; Fengming Dong (Discret. Math., 2024)