Fengming Dong

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 30

Top Topics

Equivalence Class

Top Venues

J. Graph Theory

Electron. J. Comb.

Discret. Appl. Math.

Publications

Meiqiao Zhang, Fengming Dong
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (II). Discret. Math. 347 (1) (2024)
Meiqiao Zhang, Fengming Dong
The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions. Discret. Math. 347 (12) (2024)
Yuanqiu Huang, Licheng Zhang, Fengming Dong
A new note on 1-planar graphs with minimum degree 7. Discret. Appl. Math. 348 (2024)
Meiqiao Zhang, Fengming Dong
ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2-(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$. J. Graph Theory 104 (1) (2023)
Fengming Dong, Meiqiao Zhang
. J. Comb. Theory, Ser. B 161 (2023)
Meiqiao Zhang, Fengming Dong
DP color functions versus chromatic polynomials (II). J. Graph Theory 103 (4) (2023)
Fengming Dong, Sherry H. F. Yan
Proving identities on weight polynomials of tiered trees via Tutte polynomials. J. Comb. Theory, Ser. A 193 (2023)
Fengming Dong, Jun Ge, Zhangdong Ouyang
Express the number of spanning trees in term of degrees. Appl. Math. Comput. 415 (2022)
Meiqiao Zhang, Fengming Dong
Anti-Ramsey numbers for trees in complete multi-partite graphs. Discret. Math. 345 (12) (2022)
Fengming Dong, Jun Ge
Counting spanning trees in a complete bipartite graph which contain a given spanning forest. J. Graph Theory 101 (1) (2022)
Fengming Dong, Yan Yang
DP color functions versus chromatic polynomials. Adv. Appl. Math. 134 (2022)
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
On the Size of Matchings in 1-Planar Graph with High Minimum Degree. SIAM J. Discret. Math. 36 (4) (2022)
Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong
New upper bounds for the crossing numbers of crossing-critical graphs. Discret. Math. 345 (12) (2022)
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 (3) (2021)
Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong, Eng Guan Tay
Zip product of graphs and crossing numbers. J. Graph Theory 96 (2) (2021)
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
On the Sizes of Bipartite 1-Planar Graphs. Electron. J. Comb. 28 (2) (2021)
Fengming Dong, Jun Ge, Yan Yang
Upper bounds on the signed edge domination number of a graph. Discret. Math. 344 (2) (2021)
Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong
The Maximal 1-Planarity and Crossing Numbers of Graphs. Graphs Comb. 37 (4) (2021)
Fengming Dong
New expressions for order polynomials and chromatic polynomials. J. Graph Theory 94 (1) (2020)
Xiao Zhao, Fengming Dong, Sheng Chen
On nonfeasible edge sets in matching-covered graphs. J. Graph Theory 95 (2) (2020)
Jun Ge, Fengming Dong
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. Discret. Appl. Math. 283 (2020)
Ruixue Zhang, Fengming Dong
Problems on chromatic polynomials of hypergraphs. Electron. J. Graph Theory Appl. 8 (2) (2020)
Ruixue Zhang, Fengming Dong
Zero-free intervals of chromatic polynomials of hypergraphs. Discret. Math. 343 (12) (2020)
Zhangdong Ouyang, Fengming Dong, Eng Guan Tay
On the skewness of Cartesian products with trees. Discret. Appl. Math. 267 (2019)
Fengming Dong
A survey on the study of real zeros of flow polynomials. J. Graph Theory 92 (4) (2019)
Qingying Deng, Xian'an Jin, Fengming Dong, Eng Guan Tay
Even Subgraph Expansions for the Flow Polynomial of Planar Graphs with Maximum Degree at Most 4. Electron. J. Comb. 25 (2) (2018)
Fengming Dong
On Graphs whose Flow Polynomials have Real Roots Only. Electron. J. Comb. 25 (3) (2018)
Fengming Dong
From G-parking functions to B-parking functions. J. Comb. Theory, Ser. A 160 (2018)
Fengming Dong, Weigen Yan
Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs. J. Graph Theory 85 (1) (2017)
Ruixue Zhang, Fengming Dong
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs. Eur. J. Comb. 64 (2017)
Fengming Dong, Xian'an Jin
Zeros of Jones Polynomials of Graphs. Electron. J. Comb. 22 (3) (2015)
Boon Leong Ng, Fengming Dong
The chromatic equivalence class of K1, n, n+2. Discret. Math. 338 (5) (2015)
Fengming Dong, Weigen Yan, Fuji Zhang
On the number of perfect matchings of line graphs. Discret. Appl. Math. 161 (6) (2013)
Rundan Xing, Bo Zhou, Fengming Dong
On atom-bond connectivity index of connected graphs. Discret. Appl. Math. 159 (15) (2011)
Xian'an Jin, Fuji Zhang, Fengming Dong, Eng Guan Tay
Zeros of the Jones Polynomial are Dense in the Complex Plane. Electron. J. Comb. 17 (1) (2010)
Xian'an Jin, Fengming Dong, Eng Guan Tay
On graphs determining links with maximal number of components via medial construction. Discret. Appl. Math. 157 (14) (2009)