| Chromatic polynomials and chromaticity of graphs FM Dong, KM Koh, KL Teo World Scientific, 2005 | 389 | 2005 |
| On atom–bond connectivity index of connected graphs RD Xing, B Zhou, FM Dong Discrete Applied Mathematics 159 (15), 1617-1630, 2011 | 128 | 2011 |
| The vertex-cover polynomial of a graph FM Dong, MD Hendy, KL Teo, CHC Little Discrete mathematics 250 (1-3), 71-78, 2002 | 40 | 2002 |
| Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs FM Dong, KM Koh, KL Teo, CHC Little, MD Hendy Journal of Graph Theory 37 (1), 48-77, 2001 | 37 | 2001 |
| Introduction to graph theory: H3 mathematics KM Koh, FM Dong, EG Tay World Scientific Publishing Company, 2007 | 34 | 2007 |
| Expression for the number of spanning trees of line graphs of arbitrary connected graphs FM Dong, WG Yan Journal of Graph Theory 85 (1), 74-93, 2017 | 33 | 2017 |
| Chromaticity of some families of dense graphs FM Dong, KL Teo, CHC Little, MD Hendy Discrete Mathematics 258 (1-3), 303-321, 2002 | 33 | 2002 |
| The maximum number of maximal independent sets in unicyclic connected graphs KM Koh, CY Goh, FM Dong Discrete mathematics 308 (17), 3761-3769, 2008 | 29 | 2008 |
| On the number of perfect matchings of line graphs FM Dong, WG Yan, FJ Zhang Discrete Applied Mathematics 161 (6), 794-801, 2013 | 28 | 2013 |
| Non-chordal graphs having integral-root chromatic polynomials II FM Dong, KL Teo, KM Koh, MD Hendy Discrete mathematics 245 (1-3), 247-253, 2002 | 28 | 2002 |
| Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs J Ge, FM Dong Discrete Applied Mathematics 283, 542-554, 2020 | 26 | 2020 |
| Zeros of the Jones polynomial are dense in the complex plane XA Jin, FJ Zhang, FM Dong, EG Tay The Electronic Journal of Combinatorics 17 (1), R94, 2010 | 25 | 2010 |
| Chromatically unique multibridge graphs FM Dong, KL Teo, CHC Little, M Hendy, KM Koh The Electronic Journal of Combinatorics 11 (1), R12, 2004 | 24 | 2004 |
| Proof of a chromatic polynomial conjecture FM Dong Journal of Combinatorial Theory, Series B 78 (1), 35-44, 2000 | 24 | 2000 |
| The rank of a complex unit gain graph in terms of the matching number SJ He, RX Hao, FM Dong Linear Algebra and its Applications 589, 158-185, 2020 | 23 | 2020 |
| Two invariants for adjointly equivalent graphs FM Dong, KL Teo, CHC Little, M Hendy Australasian Journal of Combinatorics 25, 133-143, 2002 | 23 | 2002 |
| On graphs determining links with maximal number of components via medial construction XA Jin, FM Dong, EG Tay Discrete applied mathematics 157 (14), 3099-3110, 2009 | 22 | 2009 |
| Uniqueness of the chromatic polynomial of a generalized wheel graph (Chinese) FM Dong Journal of Mathematical Research and Exposition 10 (3), 447-452, 1990 | 22* | 1990 |
| Determining the component number of links corresponding to lattices XA Jin, FM Dong, EG Tay Journal of Knot Theory and its Ramifications 18 (12), 1711-1726, 2009 | 21 | 2009 |
| On chromatic uniqueness of two infinite families of graphs FM Dong Journal of graph theory 17 (3), 387-392, 1993 | 21 | 1993 |
Eng Guan TayNanyang Technological University, National Institute of Education, SingaporeEmail verificata su nie.edu.sg
