Fengming Dong

43 papers Journal 42
YearRankTypeTitle / Venue / Authors
2026 J jnl
A neighborhood union condition for the existence of a spanning tree without degree 2 vertices.
Discret. Math.
Yibo Li, Fengming Dong, Xiaolan Hu, Huiqing Liu
2026 J jnl
A study on T-equivalent graphs.
Adv. Appl. Math.
Fengming Dong, Meiqiao Zhang
2026 J jnl
DP color functions of hypergraphs.
J. Comb. Optim.
Ruiyi Cui, Liangxia Wan, Fengming Dong
2026 J jnl
Enumeration of spanning trees containing a perfect matching in saturated non-covered graphs.
Discret. Appl. Math.
Yan Tang, Fengming Dong, Tao Tian
2025 J jnl
4-Connected 1-Planar Chordal Graphs Are Hamiltonian-Connected.
J. Graph Theory
Licheng Zhang, Yuanqiu Huang, Shengxiang Lv, Fengming Dong
2024 J jnl
A new note on 1-planar graphs with minimum degree 7.
Discret. Appl. Math.
Yuanqiu Huang, Licheng Zhang, Fengming Dong
2024 J jnl
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (II).
Discret. Math.
Meiqiao Zhang, Fengming Dong
2024 — book
Introduction to Graph Theory - With Solutions to Selected Problems
Introduction to Graph Theory
Khee Meng Koh, Fengming Dong, Eng Guan Tay
2024 J jnl
On the maximum local mean order of sub-k $k$-trees of a k $k$-tree.
J. Graph Theory
Zhuo Li, Tianlong Ma, Fengming Dong, Xian'an Jin
2024 J jnl
The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions.
Discret. Math.
Meiqiao Zhang, Fengming Dong
2023 J jnl
An improved lower bound of
J. Comb. Theory B
Fengming Dong, Meiqiao Zhang
2023 J jnl
DP color functions versus chromatic polynomials (II).
J. Graph Theory
Meiqiao Zhang, Fengming Dong
2023 J jnl
Proving identities on weight polynomials of tiered trees via Tutte polynomials.
J. Comb. Theory A
Fengming Dong, Sherry H. F. Yan
2023 J jnl
ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2-(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$.
J. Graph Theory
Meiqiao Zhang, Fengming Dong
2022 J jnl
Anti-Ramsey numbers for trees in complete multi-partite graphs.
Discret. Math.
Meiqiao Zhang, Fengming Dong
2022 J jnl
Counting spanning trees in a complete bipartite graph which contain a given spanning forest.
J. Graph Theory
Fengming Dong, Jun Ge
2022 J jnl
DP color functions versus chromatic polynomials.
Adv. Appl. Math.
Fengming Dong, Yan Yang
2022 J jnl
Express the number of spanning trees in term of degrees.
Appl. Math. Comput.
Fengming Dong, Jun Ge, Zhangdong Ouyang
2022 J jnl
New upper bounds for the crossing numbers of crossing-critical graphs.
Discret. Math.
Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong
2022 J jnl
On the Size of Matchings in 1-Planar Graph with High Minimum Degree.
SIAM J. Discret. Math.
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
2021 J jnl
On the Sizes of Bipartite 1-Planar Graphs.
Electron. J. Comb.
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
2021 J jnl
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations.
J. Graph Theory
Fengming Dong, Jun Ge, Helin Gong, Bo Ning, Zhangdong Ouyang, Eng Guan Tay
2021 J jnl
The Maximal 1-Planarity and Crossing Numbers of Graphs.
Graphs Comb.
Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong
2021 J jnl
Upper bounds on the signed edge domination number of a graph.
Discret. Math.
Fengming Dong, Jun Ge, Yan Yang
2021 J jnl
Zip product of graphs and crossing numbers.
J. Graph Theory
Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong, Eng Guan Tay
2020 J jnl
New expressions for order polynomials and chromatic polynomials.
J. Graph Theory
Fengming Dong
2020 J jnl
On nonfeasible edge sets in matching-covered graphs.
J. Graph Theory
Xiao Zhao, Fengming Dong, Sheng Chen
2020 J jnl
Problems on chromatic polynomials of hypergraphs.
Electron. J. Graph Theory Appl.
Ruixue Zhang, Fengming Dong
2020 J jnl
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs.
Discret. Appl. Math.
Jun Ge, Fengming Dong
2020 J jnl
Zero-free intervals of chromatic polynomials of hypergraphs.
Discret. Math.
Ruixue Zhang, Fengming Dong
2019 J jnl
A survey on the study of real zeros of flow polynomials.
J. Graph Theory
Fengming Dong
2019 J jnl
On the skewness of Cartesian products with trees.
Discret. Appl. Math.
Zhangdong Ouyang, Fengming Dong, Eng Guan Tay
2018 J jnl
Even Subgraph Expansions for the Flow Polynomial of Planar Graphs with Maximum Degree at Most 4.
Electron. J. Comb.
Qingying Deng, Xian'an Jin, Fengming Dong, Eng Guan Tay
2018 J jnl
From G-parking functions to B-parking functions.
J. Comb. Theory A
Fengming Dong
2018 J jnl
On Graphs whose Flow Polynomials have Real Roots Only.
Electron. J. Comb.
Fengming Dong
2017 J jnl
Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs.
J. Graph Theory
Fengming Dong, Weigen Yan
2017 J jnl
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs.
Eur. J. Comb.
Ruixue Zhang, Fengming Dong
2015 J jnl
The chromatic equivalence class of K1, n, n+2.
Discret. Math.
Boon Leong Ng, Fengming Dong
2015 J jnl
Zeros of Jones Polynomials of Graphs.
Electron. J. Comb.
Fengming Dong, Xian'an Jin
2013 J jnl
On the number of perfect matchings of line graphs.
Discret. Appl. Math.
Fengming Dong, Weigen Yan, Fuji Zhang
2011 J jnl
On atom-bond connectivity index of connected graphs.
Discret. Appl. Math.
Rundan Xing, Bo Zhou, Fengming Dong
2010 J jnl
Zeros of the Jones Polynomial are Dense in the Complex Plane.
Electron. J. Comb.
Xian'an Jin, Fuji Zhang, Fengming Dong, Eng Guan Tay
2009 J jnl
On graphs determining links with maximal number of components via medial construction.
Discret. Appl. Math.
Xian'an Jin, Fengming Dong, Eng Guan Tay