|
Publications
by Professor Dong Fengming (updated on 22 Jan 2026) |
|
||
|
|||
|
|||
|
|||
|
|
|
||
|
|
|
||
|
|||
|
|||
|
|||
|
|
Books and
chapters: |
|
|
|
|
|
|
|
|
|
|
8. Dong,
F. et al. (2025). Chromatically Equivalent Chordal Graphs.
In: Wood, D.R., Etheridge, A.M., de Gier, J., Joshi, N. (eds) 2023 MATRIX
Annals. MATRIX Book Series, vol 6. Springer, Cham. https://doi.org/10.1007/978-3-031-76738-8_17 |
|
|
|
|
|
|
|
|
|
7. K.M.
Koh, Fengming Dong and E.G. Tay, Introduction to graph theory: with solutions to selected
problems,
World Scientific, |
|
|
|||
|
6. Fengming
Dong, Polynomials related to chromatic polynomials, 2020. https://arxiv.org/abs/2007.05217 |
|
||
|
|||
|
5. Fengming Dong
and K.M. Koh, ``Chapter 11 Foundations of the
chromatic polynomial,” in the Handbook
on the Tutte Polynomial and Related Topics, Jo Ellis-Monaghan and Iain Moffatt (ed.), pp
213-251, Florida, CRC press, 2022. |
|
||
|
|||
|
4. Khee
Meng Koh, Fengming Dong, Kah Loon Ng, Eng Guan Tay, Graph Theory: undergraduate Mathematics, World
Scientific, Singapore, 2015. DOI: 10.1142/9426 |
|
||
|
|||
|
3. K.M.
Koh, Fengming Dong and E.G. Tay, Introduction to Graph Theory (Solution Manual), World Scientific,
Singapore, 2007. DOI: 10.1142/6606 |
|
||
|
|||
|
2. K.M.
Koh, Fengming Dong and E.G. Tay, Introduction to Graph Theory (H3 Mathematics), World Scientific,
Singapore, 2007. DOI: 10.1142/6313 |
|
||
|
|||
|
1. Fengming
Dong, K.M. Koh and K.L. Teo, Chromatic Polynomials and Chromaticity of
Graphs, World
Scientific, Singapore, 2005. DOI: 10.1142/5814 |
|
||
|
Drafts
and submitted articles: |
|
||
|
|
|
||
|
1. Fengming Dong and Meiqiao
Zhang, Compare list-color functions of hypergraphs with their chromatic
polynomials. Submitted. http://arxiv.org/abs/2305.02497 2. Meiqiao Zhang, Fengming Dong
and Ruixue Zhang, On the colorability of bi-hypergraphs. Submitted. http://arxiv.org/abs/2310.06464 3. Xiao Zhao, Haojie Zheng, Fengming Dong, Hengzhe Li, and Yingbin Ma, Characterization of Equimatchable
Even-Regular Graphs. Submitted. https://arxiv.org/abs/2408.15552 4. Yibo Li, Fengming Dong and Huiqing
Liu, A neighborhood union condition for the existence of a spanning tree
without small degree vertices. Submitted.
https://arxiv.org/abs/2510.07655
5. Shumin Zhang, Minhui
Li and Fengming Dong, Partial Domination of Middle Graphs.
Submitted. http://arxiv.org/abs/2501.02879 6. Fengming Dong and Ruixue Zhang, Existence of
trees with prescribed maximum degrees and spectral radii. Submitted. https://arxiv.org/abs/2504.06617 . 7. Fengming Dong and Ruixue Zhang, Laplacian
spectrum radii of trees. Draft. 8. Yuanqiu
Huang, Ouyang Zhangdong, Licheng Zhang, Fengming Dong, Determining the minimum size of maximal 1-plane graphs.
Submitted. https://arxiv.org/abs/2502.11696 9. Ouyang
Zhangdong, Licheng Zhang, Yuanqiu Huang, Fengming
Dong, The minimum crossing number and minimum size of maximal 1-plane graphs
with given connectivity. Submitted.
https://arxiv.org/abs/2504.21558. 10. Qifan Zhang, Shuming
Zhou, Fengming Dong, Tao Tian, On the size of graph with given order and g-extra.
Submitted. 11. Qifan Zhang, Shuming
Zhou, Fengming Dong, Extremal spectral radius and r-component order connectivity. Submitted. 12. Yan Tang, Fengming
Dong, Tao Tian, Enumeration of spanning trees
containing a perfect matching in saturated non-covered graphs. 13. Tao
Tian, Fengming Dong, Every 3-connected $\{K_{1,4},K_{1,4}+e\}$-free
split graph of order at least $13$ is Hamilton-connected. Published articles: |
|
||
|
2026 |
|
|
|
|
|
108. Zongpeng Ding, Yuanqiu
Huang, Fengming Dong, Shengxiang Lv and Penni Geher , The density of maximal IC-plane graphs andaximalNIC-plane
graphs. Discrete Mathematics. Accepted. https://arxiv.org/abs/2501.10218 |
|
|
|
|
111. Ruiyi Cui, Liangxia Wan and Fengming Dong, DP
color functions of hypergraphs. Accepted. https://arxiv.org/abs/2503.14879 |
|
|
|
|
110. Shengxiang Lv and Fengming Dong, Superexponentially many nonisomorphic
genus embeddings of complete bipartite graphs, Acta Mathematica Sinica,
Chinese Series, 2026, accepted. |
|
|
|
|
109. Yibo Li, Fengming Dong, Xiaolan Hu
and Huiqing Liu, A neighborhood union condition for the existence of a
spanning tree without degree 2 vertices, Discrete Math
Volume 349, Issue 5, May
2026, 114944. https://doi.org/10.1016/j.disc.2025.114944
|
|
|
|
|
108. Zongpeng
Ding, Yuanqiu Huang, and Fengming Dong, A New
Infinite Family of 4-regular Crossing-critical Graphs, TAIWANESE
JOURNAL OF MATHEMATICS, https://doi.org/10.11650/tjm/251003 |
|
|
|
|
107. Fengming Dong and
Meiqiao Zhang, A study of T-equivalent graphs. Advances in Applied
Mathematics. Volume 173, Part A, February 2026, 102985. https://doi.org/10.1016/j.aam.2025.102985 ArXiv:https://arxiv.org/abs/2501.11383 |
|
|
|
|
|
|
|
|
2025 |
|
|
|
|
|
105.
Licheng Zhang, Yuanqiu Huang, Shengxiang Lv, Fengming Dong, 4-connected 1-planar chordal graph is
Hamiltonian-connected.
J. Graph Theory 110 (2025 Sep) (1), 72-81. https://doi.org/10.1002/jgt.23250 |
|
|
|
2024 |
|
|
|
|
|
104. Meiqiao Zhang and Fengming Dong, the absolute values of the perfect matching derangement graph's
eigenvalues almost follow the lexicographic
order of partitions. Discrete Math. 347 (Nov 2024), 114188. DOI: https://doi.org/10.1016/j.disc.2024.114188
103. Zhuo Li, Tianlong Ma, Fengming Dong and Xianan Jin, On the maximum local mean
order of sub-k-trees of a k-tree, J. Graph Theory.
107 (2) (Oct 2024), 393-409. DOI: https://doi.org/10.1002/jgt.23128 ArXiv: https://arxiv.org/abs/2309.11885 102.
Deng, Q.Y., Dong, F.M., Jin,
X.A., &Yan, Q.. Partial-dual polynomial as a
framed weight system. Communications in Mathematics 31 ( April 2024). DOI: https://doi.org/10.46298/cm.13020 . ArXiv: https://arxiv.org/abs/2402.03799 101. Yuanqiu Huang;
Licheng Zhang and Fengming Dong, A new note on 1-planar graphs with minimum
degree 7, Discrete Applied Mathematics 348 (May 2024), 165-183. DOI: https://doi.org/10.1016/j.dam.2024.01.026 |
|
|
|
|
100.
Meiqiao
Zhang and Fengming Dong, Compare list-color functions of hypergraphs with
their chromatic polynomials (II). Discrete Math 347 (Jan
2024), 113701. DOI: https://doi.org/10.1016/j.disc.2023.113701.
arXiv: http://arxiv.org/abs/2302.05067 |
|
|
|
2023 |
|
|
|
|
|
99. Meiqiao Zhang and Fengming Dong, ZDP(n)
is bounded above by n2-(n+3)/2. J. Graph Theory 104 (Sep
2023), 133-149. DOI: https://doi.org/10.1002/jgt.22952. Also at https://arxiv.org/abs/2107.08869 |
|
|
|
|
98. Fengming Dong and Meiqiao Zhang, An improved lower bound of
P(G,L)-P(G,k)
for k-assignments L. J.
Combinatorial Theory Ser. B 161
(July 2023), 109-119. DOI: http://doi.org/10.1016/j.jctb.2023.02.002 . Also at https://arxiv.org/abs/2206.14536
|
|
|
|
|
97. Meiqiao Zhang and Fengming Dong, DP color
functions versus chromatic polynomials (II). J. Graph Theory 103 (Aug
2023), 740-761. DOI: http://doi.org/10.1002/jgt.22944 . At arXiv: https://arxiv.org/abs/2203.07704 |
|
|
|
|
96. Fengming Dong and
Sherry H.F. Yan, Proving identities on weight polynomials of tiered trees via
Tutte polynomials, J. Combinatorial Theory Ser. A 193 (Jan 2023), 105689. DOI: https://doi.org/10.1016/j.jcta.2022.105689 . At
arXiv https://arxiv.org/abs/2003.00625. |
|
|
|
2022 |
|
|
|
|
|
95 Zongpeng Ding,
Zhangdong Ouyang, Yuanqiu Huang and Fengming Dong,
New upper bounds for the crossing numbers of crossing-critical graphs,
Discrete Math 345 (2022 Dec), 113090.
DOI: https://doi.org/10.1016/j.disc.2022.113090 At arXiv:
https://arxiv.org/abs/2003.06579 94 Meiqiao Zhang and Fengming Dong, the anti-ramsey number of trees in complete multi-partite graphs. Discrete Math 345
(2022
Dec), 113100. DOI: https://doi.org/10.1016/j.disc.2022.113100. At arXiv:
http://arxiv.org/abs/2107.13196 |
|
|
|
|
93. Yuanqiu Huang, Zhangdong Ouyang and Fengming Dong,
Matchings in 1-planar graphs with minimum degree 6， SIAM J.
Discrete Math 26 (2022Nov),
2570-2584. DOI: https://doi.org/10.1137/21M1459952. At arXiv http://arxiv.org/abs/2207.03747 |
|
|
|
|
92. Fengming Dong
and Jun Ge, Counting spanning trees in a complete bipartite graph which
contain a given spanning forest,
J. Graph Theory 101 (Sep 2022), 79-94.
DOI: https://doi.org/10.1002/jgt.22812. At arXiv https://arxiv.org/abs/2103.05294
|
|
|
|
|
|
|
|
|
|
91.
Ruixue Zhang, Fengming Dong and Meiqiao Zhang, Zero-Free Intervals of Chromatic
Polynomials of Mixed Hypergraphs, Mathematics 10,
no 2 (2022), 193. DOI: https://www.mdpi.com/2227-7390/10/2/193 |
|
|
|
|
|
|
|
|
|
90.
Fengming Dong and Yan Yang, DP color functions versus chromatic polynomials. Advances
in Applied Mathematics 134 (March 2022), 102301. DOI: https://doi.org/10.1016/j.aam.2021.102301. At arXiv http://arxiv.org/abs/2105.11081 |
|
|
|
|
|
|
|
|
|
89. Fengming Dong, Jun Ge and Zhangdong Ouyang, Express the number of spanning trees in term of degrees, Applied
Mathematics and Computation 415
(Feb 2022), 126697. DOI: https://doi.org/10.1016/j.amc.2021.126697. At arXiv https://arxiv.org/abs/2106.07871 |
|
|
|
|||
|
2021 |
|
|
|
|
|
|
88. Yuanqiu Huang, Zhangdong Ouyang
and Fengming Dong, On
the sizes of bipartite 1-planar graphs, Electronic Journal of
Combinatorics 28 (May 2021), P2.22. DOI: https://doi.org/10.37236/10012 . Also in https://arxiv.org/abs/2007.13308. |
|
|
|
|
|
|
|
|
|
87. Fengming Dong, Ge G., &Yan
Y., Upper bounds on the signed edge domination number of a graph. Discrete
Mathematics 344 (Feb 2021), 112201. DOI: https://doi.org/10.1016/j.disc.2020.112201. Also in https://arxiv.org/abs/2001.07955 |
|
|
|
|
|
|
|
86. Zhangdong Ouyang, Yuanqiu Huang
and Fengming Dong, On the crossing numbers of maximal 1-planar graphs, Graphs and Combinatorics 37 (April 2021), 1333–1344 . DOI: https://doi.org/10.1007/s00373-021-02320-x .
Also at https://arxiv.org/abs/2007.13308 |
|
||
|
|||
|
85. Fengming
Dong, Jun Ge, Helin Gong, Bo Ning, Zhangdong
Ouyang, Eng Guan Tay, Proving a conjecture on
chromatic polynomials by counting the number of acyclic orientations. J.
Graph Theory. 96
(March 2021), 343-360. DOI: http://doi.org/10.1002/jgt.22617 . Also at https://arxiv.org/abs/1803.08658. |
|
||
|
|
|
84. Ouyang Zhangdong,
Fengming Dong, Ruixue Zhang and Tay Eng Guan, Properties of π-skew graphs with applications, Acta Mathematica Sinica
37 (April
2021), 641–656.
DOI: https://doi.org/10.1007/s10114-020-9378-1. |
|
|
|
2020 |
|
|
|
|
|
83. Ouyang
Zhangdong, Huang Yuanqiu, Fengming Dong, Tay Eng Guan, Zip products of graphs
and crossing numbers, J.
Graph Theory 96 (Feb
2021), 289-309. DOI: http://doi.org/10.1002/jgt.22613 |
|
|
82. Ruixue Zhang,
Fengming Dong, Problems on chromatic polynomials of hypergraphs, Electronic Journal of Graph Theory and Applications
8 (2020), 241–246. dx.doi.org/10.5614/ejgta.2020.8.2.4 81. Ruixue
Zhang and Fengming Dong, Zero-free
intervals of chromatic polynomials of hypergraphs, Discrete
Mathematics 343 (Dec 2020), 112134. https://doi.org/10.1016/j.disc.2020.112134. Also in http://arxiv.org/abs/1812.01814 |
|
||
|
80. Xiao Zhao,
Fengming Dong and Sheng Chen, On non-feasible edge sets of matching-covered
bipartite graphs, J. Graph Theory 95 (Oct 2020), 192-208. https://doi.org/10.1002/jgt.22555. Also
in arXiv:1812.06240. |
|
||
|
|||
|
79. Ge Jun and
Fengming Dong, Spanning trees in complete bipartite graphs and
resistance distance in nearly complete bipartite graphs, Discrete Applied Mathematics 283
(Sep 2020), 542-554. https://doi.org/10.1016/j.dam.2020.02.002 . Also in arXiv:1904.07766. |
|
||
|
|||
|
78. Shengjie
He, Rong-Xia Hao and Fengming Dong, The rank of a complex unit gain
graph in terms of the matching number, Linear Algebra and Its
Applications 589
(2020), 158-185. https://arxiv.org/abs/1909.07555 |
|
||
|
|||
|
77. Fengming Dong, New expressions for order
polynomials and chromatic polynomials, J. Graph Theory 94 （1）（May 2020）, 30-58. http://10.1002/jgt.22505. Also
in https://arxiv.org/abs/1909.02310 |
|
||
|
|||
|
2019 |
|
||
|
|||
|
76. Fengming Dong, A
survey on real zeros of flow polynomials, J. Graph Theory 92 (Dec 2019), 361-376. 10.1002/jgt.22458. Also in arXiv:2007.05195. |
|
||
|
|||
|
75. Ouyang
Zhangdong, Fengming Dong, Tay Eng Guan, On the skewness of Cartesian
products with trees, Discrete
Applied Mathematics 267(Aug
2019), 131-141. 10.1016/j.dam.2019.05.014 |
|
||
|
|||
|
|||
|
2018 |
|
||
|
74. Fengming Dong, On graphs whose flow polynomials have real roots only. Electronic
Journal of Combinatorics 25(3) (2018), #P3.26. https://doi.org/10.37236/7512 . Also in https://arxiv.org/abs/1808.00175 |
|
||
|
|||
|
73. Fengming Dong,
From G-parking functions to B-parking functions. J. Combin. Theory Ser. A 160 (2018
Nov), 84-110. 10.1016/j.jcta.2018.06.007 . Also
in https://arxiv.org/abs/1407.1983 . |
|
||
|
|||
|
72. Qingying Deng, Xian'an Jin,
Fengming Dong and Eng Guan Tay, Even subgraph
expansions for the flow polynomial of planar graphs with maximum degree at
most 4, Electronic Journal of
Combinatorics 25(2) (2018), #P2.7. https://doi.org/10.37236/7411 |
|
||
|
|||
|
71. Fengming
Dong, W.K. Ho and D.S. Zhao, A
Study on Rank Commutators of Special Families of Matrices, Southeast Asian Bulletin of Mathematics Vol.42(1)
(2018) page: 15-30. |
|
||
|
|||
|
2017 |
|
||
|
|||
|
70. Yanna Wang, Rundan
Xing, Bo Zhou, and Fengming Dong, A note on distance spectral radius of trees, Special Matrices 5 (2017), 296–300.
10.1515/spma-2017-0021 |
|
||
|
|||
|
69. Ruixue Zhang and
Fengming Dong, Properties of chromatic
polynomials of hypergraphs not held for chromatic polynomials of
graphs, European Journal of Combinatorics, Volume 64 (August
2017), 138–151. 10.1016/j.ejc.2017.04.006. Also
in: http://arxiv.org/abs/1611.04245 |
|
||
|
|||
|
68. Fengming Dong
and Yan Weigen, Expression for the Number of Spanning Trees of Line
Graphs of Arbitrary Connected Graphs, J. Graph Theory 85(1) (May
2017), 74–93. 10.1002/jgt.22048. Also in: https://arxiv.org/abs/1507.08022 |
|
||
|
|||
|
2015 |
|
||
|
|||
|
67. Fengming Dong
and Jin Xian’ an, Bounds for zeros of Jones polynomials of graphs, Electronic
Journal of Combinatorics, Volume 22, Issue 3 (Aug 2015), Paper
#P3.23. https://doi.org/10.37236/4627 |
|
||
|
|||
|
66. Fengming
Dong, On graphs having no flow roots in the
interval (1,2), Electronic Journal of Combinatorics, Volume 22,
Issue 1 (March 2015) , Paper #P1.82.
https://doi.org/10.37236/3841 |
|
||
|
|||
|
65. Boon Leong Ng
and Fengming Dong, The Chromatic
Equivalence Classes of K(1,n,n+2), Discrete Math 338 (5) (2015),
674–687. 10.1016/j.disc.2014.12.013 |
|
||
|
|||
|
64. Fengming
Dong, On Zero-free Intervals of Flow Polynomials, J.Combin.
Theory Ser. B 111 (March 2015 ), 181-200. |
|
||
|
|||
|
2014 |
|
||
|
|||
|
63. Rundan Xing, Bo Zhou and Fengming Dong, The effect
of a graft transformation on distance spectral radius, Linear Algebra and its applications 457 (Sep.
2014), 261-274. 10.1016/j.laa.2014.05.024 |
|
||
|
|||
|
62. Fengming Dong, E.G. Tay and K.M.
Koh, Nowhere-zero
3-flows in tensor products of graphs, Ars Combinatoria 117 (Oct.
2014), 375-386. http://www.combinatorialmath.ca/ArsCombinatoria/vol117.html |
|
||
|
|||
|
61. Fengming Dong,
Dongsheng Zhao and Wenkin Ho, On the largest outscribed
equilateral triangle, The
Mathematical Gazette 98 (March 2014), 79-84. |
|
||
|
|||
|
2013 |
|
||
|
|||
|
60. Fengming Dong,
Ho Weng Kin, and Lee Tuo Yeong, A Family of Identities via
Arbitrary Polynomials, THE
COLLEGE MATHEMATICS JOURNAL 43(2013), 44-47. 10.4169/college.math.j.44.1.043 |
|
||
|
|||
|
59. Fengming Dong,
Weigen Yan and Fuji Zhang, On the number of perfect matchings of line
graphs, Discrete Applied
Mathematics 161 (Apr. 2013), Issue 6, Pages 794-801. 10.1016/j.dam.2012.10.032 |
|
||
|
|||
|
2012 |
|
||
|
|||
|
58. K.M. Koh, T.S.
Ting and Fengming Dong, A Characterisation of
Cycle-Disjoint Graphs with Unique Minimum Weakly Connected Dominating Set, Australasian J. of Combinatorics, Volume 54 (Oct.
2012), Pages 177–187. |
|
||
|
|||
|
57. Fengming Dong
and K.M. Koh, The 3-connectivity of a Graph and the Multiplicity of Zero
`2' of its Chromatic Polynomial, J. Graph Theory 70(3) 2012,
262-283. 10.1002/jgt.20614 |
|
||
|
|||
|
56. Fengming
Dong, A new expression for matching polynomials, Discrete Math. 312 (Feb.
2012) 803–807. 10.1016/j.disc.2011.11.019 |
|
||
|
|||
|
2011 |
|
||
|
|||
|
55. R. Xing, B.
Zhou, Fengming Dong, On atom-bond connectivity index of connected
graphs, Discrete Applied
Mathematics 159 (Sep. 2011), 1617–1630. 10.1016/j.dam.2011.06.004 |
|
||
|
|||
|
54. Fengming Dong,
Gordon Royle and Dave Wagner, Chromatic roots of a ring of four
cliques, Electronic Journal of
Combinatorics 18(July 2011), #P151. https://doi.org/10.37236/638 |
|
||
|
|||
|
53. Fengming Dong
and B. Jackson, A zero-free interval for chromatic polynomials of nearly
3-connected plane graphs, SIAM J.
On Discrete Mathematics 25, 1103-1118 (July 2011). 10.1137/100790057 |
|
||
|
|||
|
2010 |
|
||
|
|||
|
52. Xian’an Jin, Fuji Zhang, Fengming Dong and Eng Guan
Tay, Zeros of the Jones polynomial are dense in the complex
plane, Electronic Journal of
Combinatorics 17(2010), #R94. 10.37236/366 |
|
||
|
|||
|
51. Fengming Dong
and K.M. Koh, On Zero-free Intervals in (1,2) of Chromatic Polynomials
of Some Families of Graphs, SIAM
J. On Discrete Mathematics 24(2) (2010), 370-378. 10.1137/070698294 |
|
||
|
|||
|
50. K.M.
Koh, T.S. Ting, Z.L. Xu and Fengming Dong, Lower Bound on the Weakly Connected Domination Number of a
Cycle-disjoint Graph, Australasian
J. of Combinatorics 46 (2010), 157–166. |
|
||
|
|||
|
2009 |
|
||
|
|||
|
49. Xian’an Jin, Fengming Dong and Eng Guan Tay, Determining
the component number of links
corresponding to lattices, J. Knot
Theory and its Ramifications 18(12) (2009), 1711-1726. 10.1142/S0218216509007671 |
|
||
|
|||
|
48. Xian’an Jin, Fengming Dong and Eng Guan Tay, On graphs determining links with maximal number of
components via medial construction, Discrete
Applied Mathematics 157 (2009), 3099-3110. 10.1016/j.dam.2009.06.006 |
|
||
|
|||
|
2008 |
|
||
|
|||
|
47. Fengming Dong
and K.M. Koh, Bounds for the real zeros of chromatic polynomials, Combinatorics, Probability and Computing (2008) 17, 749-759.
10.1017/S0963548308009449 |
|
||
|
|||
|
46. K.M. Koh, Goh.C.Y. and Fengming Dong (corresponding author), The Maximum Number of Maximal Independent
Sets in Unicyclic Connected Graphs, Discrete Math. 308(2008), 3761-3769. 10.1016/j.disc.2007.07.079 |
|
||
|
|||
|
45. Fengming Dong
and K.M. Koh, On planar and non-planar graphs
having no chromatic zeros in the interval (1,2), Discrete Math. 308(2008), 3897-3905. 10.1016/j.disc.2007.07.093 |
|
||
|
|||
|
44. Fengming Dong
and K.M. Koh, A maximal zero-free interval of chromatic polynomials of
bipartite planar graphs, Discrete
Math. 308 (2008), 2285-2287. 10.1016/j.disc.2007.04.063 |
|
||
|
|||
|
43. Fengming Dong
and K.M. Koh, Domination numbers and chromatic polynomials, Discrete Math.308 (2008),
1930-1940. |
|
||
|
|||
|
2007 |
|
||
|
|||
|
42. Fengming Dong
and K.M. Koh, Bounds for the coefficients of flow polynomials, J. Combin.
Theory Ser. B 97 (2007), 413-420. 10.1016/j.jctb.2006.07.005 |
|
||
|
|||
|
2006 |
|
||
|
|||
|
41. Fengming Dong
and K.M. Koh, On graphs having no chromatic
zeros in the interval (1,2), SIAM J. On Discrete Mathematics （20）(2006), 799-810. 10.1137/04061787X |
|
||
|
|||
|
2005 |
|
||
|
|||
|
40. Fengming
Dong, Further results on the lower bounds of Mean Colour
numbers, J. Graph Theory 48 (2005),
51-73. 10.1002/jgt.20034 |
|
||
|
|||
|
2004 |
|
||
|
|||
|
39. Fengming Dong
and K.M. Koh, On upper bounds of real roots of chromatic
polynomials, Discrete Math. 282 (2004),
95-101. 10.1016/j.disc.2003.12.005 |
|
||
|
|||
|
38. Fengming Dong, The largest non-integer real zero of
chromatic polynomials of graphs with fixed order, Discrete Math. 282 (2004), 103-112. 10.1016/j.disc.2003.11.006 |
|
||
|
|||
|
37. Fengming Dong,
K.M. Koh and C.A. Soh, Divisibility of Certain Coefficients of the
Chromatic Polynomials, Discrete
Math. 275 (2004), 311-317. 10.1016/j.disc.2003.05.007 |
|
||
|
|||
|
36. Fengming Dong,
K.L. Teo, C.H.C. Little, M.D. Hendy and K.M. Koh, Chromatically unique Multi-bridge Graphs, Electronic Journal of Combinatorics 11 (2004), #R12. https://doi.org/10.37236/1765 |
|
||
|
|||
|
35. Fengming Dong,
M.D. Hendy, K.L. Teo and C.H.C. Little, Graph-functions associated with an edge property, Australasian J. of Combinatorics 30 (2004),
3-20. |
|
||
|
|||
|
34. Fengming Dong
and K.M. Koh, Two results on real roots of chromatic polynomials, Combin. Probab.
Comput. 13 (2004), 809-813. 10.1017/S0963548304006418 |
|
||
|
|||
|
33. Tay Eng Guan,
Toh Tin Lam, Dong Fengming and Lee Tuo Yeong, The convergence of a
linearly recursive sequence, the
International Journal of Mathematical Education in Science and Technology (Classroom
Notes) 35 (2004), no.1, 51-63. 10.1080/00207390310001615561 |
|
||
|
|||
|
2003 |
|
||
|
|||
|
32. F.D. Dong, Bounds on mean colour
numbers of graphs, J. Combin. Theory Ser. B 87 (2003), 348-365. |
|
||
|
|||
|
2002 |
|
||
|
|||
|
31. Fengming Dong,
K.L. Teo, C.H.C.Little and
M. Hendy, Chromaticity of some families of dense graphs, Discrete Math. 258 (2002),
303-321. 10.1016/S0012-365X(02)00355-2 |
|
||
|
|||
|
30. Fengming Dong,
M. Hendy, K.L. Teo and C.H.C. Little, The vertex-cover polynomial
of a graph, Discrete Math. 250 (2002),
71-78. 10.1016/s0012-365x(01)00272-2 |
|
||
|
|||
|
29. Fengming Dong,
K.L. Teo, K.M. Koh and M. Hendy, Non-chordal graphs having
integral-root chromatic polynomials (II), Discrete Math. 245 (2002), 247-253. 10.1016/s0012-365x(01)00307-7 |
|
||
|
|||
|
28. Fengming Dong,
K.L. Teo and K.M. Koh, A Note on the
Chromaticity of Some 2-connected (n, n+3)-Graph, Discrete Math. 243 (2002),
217-221. 10.1016/S0012-365X(01)00217-5 |
|
||
|
|||
|
|||
|
|||
|
|||
|
|||
|
2001 |
|
||
|
|||
|
25. Fengming Dong,
K.M. Koh, K.L. Teo, C.H.C.Little
and M. Hendy, Sharp bounds for the number of 3-partitions and the chromatic uniqueness of bipartite
graphs, J. Graph Theory 37 (2001),
48-77. 10.1002/jgt.1003 |
|
||
|
|||
|
|||
|
|||
|
23. Fengming Dong, K.M. Koh and K.L. Teo,
Structures and chromaticity of extremal 3-colourable sparse graphs, Graphs
and Combinatorics 17 (2001), no. 4, 611-635. 10.1007/PL00007254 |
|
||
|
|||
|
2000 |
|
||
|
|||
|
22. Fengming
Dong, Proof of a chromatic polynomial conjecture, J. Combin.
Theory Ser. B 78 (2000), 35-44.
10.1006/jctb.1999.1925 |
|
||
|
|||
|
21. Fengming Dong,
K.M. Koh, K.L. Teo, C.H.C.Little
and M. Hendy, Chromatically unique bipartite graphs
with low 3-independent partition numbers, Discrete Math. 224 (2000), 107-124. 10.1016/S0012-365X(00)00094-7 |
|
||
|
|||
|
20. Fengming Dong,
K.M. Koh, K.L. Teo, C.H.C.Little
and M. Hendy, An attempt to classify bipartite
graphs by chromatic polynomials, Discrete
Math. 222 (2000), 73-88. 10.1016/S0012-365X(00)00007-8 |
|
||
|
|||
|
1999 |
|
||
|
|||
|
19. Fengming
Dong and K.M. Koh, Structures and chromaticity of some extremal
3-colourable graphs, Discrete
Math. 203 (1999), 71-82. 10.1016/S0012-365X(99)00014-X |
|
||
|
|||
|
1998 |
|
||
|
|||
|
18. Fengming Dong
and Y.P. Liu, All wheels with two missing
consecutive spokes are chromatically unique, Discrete Math. 184 (1998),
71-85. 10.1016/S0012-365X(96)00288-9 |
|
||
|
|||
|
17. Fengming Dong and
K.M. Koh, Non-chordal graphs having
integral-root chromatic polynomials, Bull. Inst. Combin.
Appl. 22 (1998), 67-77. |
|
||
|
|||
|
1997 |
|
||
|
|||
|
16. Fengming Dong
and K.M. Koh, on the structure and chromaticity of graphs in
which any two colour classes induce a tree, Discrete Math. 176 (1997),
97-113. 10.1016/S0012-365X(96)00289-0 |
|
||
|
|||
|
15. Fengming Dong
and K.M. Koh, On graphs in which any pair
of colour classes but one induces a tree, Discrete Math. 169 (1997),
39-54. 10.1016/0012-365X(95)00331-P |
|
||
|
|||
|
14. Fengming Dong,
Y.P. Liu and K.M. Koh, The chromaticity of odd wheels with a missing spoke, New Zealand Journal of Math. 26 (1997),
31-44. |
|
||
|
|||
|
1996 |
|
||
|
|||
|
13. Fengming Dong
and Y.P. Liu, On the chromatic uniqueness of the graph W(n,n-2;k), Graphs and Combinatorics 12 (1996), 221-230. 2-s2.0-25644456778 |
|
||
|
|||
|
12. Fengming Dong and
K.M. Koh, The sizes of graphs with small girth, Bull.
Inst. Combin. Appl. 12 (1996),
33-44. |
|
||
|
|||
|
11. Y.F. Xu and Fengming Dong, On graphs with zero determinant of
adjacency matrices, (in Chinese), Math.
Appl. 9 (1996), no. 2, 254-255. |
|
||
|
|||
|
1995 |
|
||
|
|||
|
10. Fengming Dong
and Y.P. Liu, On the chromatic uniqueness
of the graph W(n,n-2)+Kk, Discrete Math. 145 (1995),
95-103. 10.1016/0012-365X(94)00056-O |
|
||
|
|||
|
1993 |
|
||
|
|||
|
9. Fengming Dong, On chromatic uniqueness of two infinite
families of graphs, J. Graph
Theory 17 (1993), 387-392. |
|
||
|
|||
|
8. Fengming Dong and
Y.P. Liu, Counting rooted near-triangulations on the
sphere, Discrete Math. 123 (1993),
35-45. |
|
||
|
|||
|
1991 |
|
||
|
|||
|
7. Fengming
Dong, The chromatic uniqueness of two classes of special graphs, (in Chinese), Acta Mathematica Sinica 34 (1991),
242-251. |
|
||
|
|||
|
1990 |
|
||
|
|||
|
6. Fengming Dong, On the uniqueness of chromatic polynomial of generalized
wheels,
(in Chinese), J. Math. Research
and Exposition 10 (1990), 447-454. |
|
||
|
|||
|
1989 |
|
||
|
|||
|
5. Y.P. Liu, Fengming Dong and X.G. Li, On PRS-conjecture on diameters of
iterated clique graphs (abstract), (in Chinese), Science
Bulletin 34 (1989), 714-715. |
|
||
|
|||
|
4. Fengming Dong and
J.Y. Yan, Enumeration of rooted outer-planar graphs, (in Chinese), Acta Mathematica Sinica 32 (1989),
501-511. |
|
||
|
|||
|
|||
|
|||
|
Mathematics papers published in conference
proceedings: |
|
||
|
|||
|
3. Fengming Dong and K.M. Koh, The acyclic colouring,
triangle number and chromatic polynomial of a graph, Algebras
and Combinatorics -- An international Congress, ICAC'97, Hong Kong
(1999), 217-236. |
|
||
|
|||
|
|||
|
Papers more related
to Mathematics Education |
|
||
|
|||
|
|||
|
2. Fengming Dong, Y.H. Liang, T.Y. Lee,
E.G. Tay, T.L. Toh and E.F. Wood, Generalization of a geometric
problem, Math. Medley 31 (2004), no. 1, 24-29. |
|
||
|
|||
|
1. Lee Tuo Yeong, Tay Eng Guan, Toh Tin
Lam and Dong Fengming, Multi-solutions of a Geometry problem, Math.
Medley, 30 (2003), no. 1, 43-53. |
|
||