default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFengming Dong
Person information
- affiliation: Nanyang Technological University, National Institute of Education, Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Khee Meng Koh, Fengming Dong, Eng Guan Tay:
Introduction to Graph Theory - With Solutions to Selected Problems. WorldScientific 2024, ISBN 9789811284816, pp. 1-308- [j80]Yuanqiu Huang, Licheng Zhang
, Fengming Dong:
A new note on 1-planar graphs with minimum degree 7. Discret. Appl. Math. 348: 165-183 (2024) - [j79]Meiqiao Zhang, Fengming Dong:
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (II). Discret. Math. 347(1): 113701 (2024) - [j78]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): 114188 (2024) - 2023
- [j77]Fengming Dong, Sherry H. F. Yan:
Proving identities on weight polynomials of tiered trees via Tutte polynomials. J. Comb. Theory A 193: 105689 (2023) - [j76]Fengming Dong, Meiqiao Zhang:
An improved lower bound of P(G,L)-P(G,k) for k-assignments L. J. Comb. Theory B 161: 109-119 (2023) - [j75]Meiqiao Zhang, Fengming Dong:
DP color functions versus chromatic polynomials (II). J. Graph Theory 103(4): 740-761 (2023) - [j74]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): 133-149 (2023) - 2022
- [j73]Fengming Dong, Yan Yang:
DP color functions versus chromatic polynomials. Adv. Appl. Math. 134: 102301 (2022) - [j72]Fengming Dong, Jun Ge, Zhangdong Ouyang:
Express the number of spanning trees in term of degrees. Appl. Math. Comput. 415: 126697 (2022) - [j71]Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong:
New upper bounds for the crossing numbers of crossing-critical graphs. Discret. Math. 345(12): 113090 (2022) - [j70]Meiqiao Zhang, Fengming Dong:
Anti-Ramsey numbers for trees in complete multi-partite graphs. Discret. Math. 345(12): 113100 (2022) - [j69]Fengming Dong, Jun Ge:
Counting spanning trees in a complete bipartite graph which contain a given spanning forest. J. Graph Theory 101(1): 79-94 (2022) - [j68]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): 2570-2584 (2022) - 2021
- [j67]Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong:
On the Sizes of Bipartite 1-Planar Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j66]Fengming Dong, Jun Ge, Yan Yang:
Upper bounds on the signed edge domination number of a graph. Discret. Math. 344(2): 112201 (2021) - [j65]Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong:
The Maximal 1-Planarity and Crossing Numbers of Graphs. Graphs Comb. 37(4): 1333-1344 (2021) - [j64]Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong, Eng Guan Tay:
Zip product of graphs and crossing numbers. J. Graph Theory 96(2): 289-309 (2021) - [j63]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): 343-360 (2021) - 2020
- [j62]Jun Ge, Fengming Dong:
Spanning trees in complete bipartite graphs and resistance distance in nearly complete bipartite graphs. Discret. Appl. Math. 283: 542-554 (2020) - [j61]Ruixue Zhang, Fengming Dong:
Zero-free intervals of chromatic polynomials of hypergraphs. Discret. Math. 343(12): 112134 (2020) - [j60]Ruixue Zhang, Fengming Dong:
Problems on chromatic polynomials of hypergraphs. Electron. J. Graph Theory Appl. 8(2): 241-246 (2020) - [j59]Fengming Dong:
New expressions for order polynomials and chromatic polynomials. J. Graph Theory 94(1): 30-58 (2020) - [j58]Xiao Zhao, Fengming Dong, Sheng Chen:
On nonfeasible edge sets in matching-covered graphs. J. Graph Theory 95(2): 192-208 (2020)
2010 – 2019
- 2019
- [j57]Zhangdong Ouyang, Fengming Dong, Eng Guan Tay:
On the skewness of Cartesian products with trees. Discret. Appl. Math. 267: 131-141 (2019) - [j56]Fengming Dong:
A survey on the study of real zeros of flow polynomials. J. Graph Theory 92(4): 361-376 (2019) - 2018
- [j55]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): 2 (2018) - [j54]Fengming Dong:
On Graphs whose Flow Polynomials have Real Roots Only. Electron. J. Comb. 25(3): 3 (2018) - [j53]Fengming Dong:
From G-parking functions to B-parking functions. J. Comb. Theory A 160: 84-110 (2018) - 2017
- [j52]Ruixue Zhang, Fengming Dong:
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs. Eur. J. Comb. 64: 138-151 (2017) - [j51]Fengming Dong, Weigen Yan:
Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs. J. Graph Theory 85(1): 74-93 (2017) - 2015
- [j50]Feng Ming Dong:
On Graphs Having no Flow Roots in the Interval $(1, 2)$. Electron. J. Comb. 22(1): 1 (2015) - [j49]Fengming Dong, Xian'an Jin:
Zeros of Jones Polynomials of Graphs. Electron. J. Comb. 22(3): 3 (2015) - [j48]Boon Leong Ng, Fengming Dong:
The chromatic equivalence class of K1, n, n+2. Discret. Math. 338(5): 674-687 (2015) - [j47]Feng Ming Dong:
On zero-free intervals of flow polynomials. J. Comb. Theory B 111: 181-200 (2015) - 2014
- [j46]Feng Ming Dong, Eng Guan Tay, Khee Meng Koh:
Nowhere-zero 3-flows in Tensor Products of Graphs. Ars Comb. 117: 375-386 (2014) - 2013
- [j45]Fengming Dong, Weigen Yan, Fuji Zhang:
On the number of perfect matchings of line graphs. Discret. Appl. Math. 161(6): 794-801 (2013) - 2012
- [j44]Khee Meng Koh, T. S. Ting, Feng Ming Dong:
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set. Australas. J Comb. 54: 177-188 (2012) - [j43]Feng Ming Dong:
A new expression for matching polynomials. Discret. Math. 312(4): 803-807 (2012) - [j42]Feng Ming Dong, Khee Meng Koh:
The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial. J. Graph Theory 70(3): 262-283 (2012) - 2011
- [j41]Feng Ming Dong, Gordon F. Royle, Dave Wagner:
Chromatic Roots of a Ring of Four Cliques. Electron. J. Comb. 18(1) (2011) - [j40]Rundan Xing, Bo Zhou, Fengming Dong:
On atom-bond connectivity index of connected graphs. Discret. Appl. Math. 159(15): 1617-1630 (2011) - [j39]Feng Ming Dong, Bill Jackson:
A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs. SIAM J. Discret. Math. 25(3): 1103-1118 (2011) - 2010
- [j38]Khee Meng Koh, T. S. Ting, Z. L. Xu, Feng Ming Dong:
Lower bound on the weakly connected domination number of a cycle-disjoint graph. Australas. J Comb. 46: 157-166 (2010) - [j37]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) - [j36]Feng Ming Dong, Khee Meng Koh:
On Zero-Free Intervals in (1, 2) of Chromatic Polynomials of Some Families of Graphs. SIAM J. Discret. Math. 24(2): 370-378 (2010)
2000 – 2009
- 2009
- [j35]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): 3099-3110 (2009) - 2008
- [j34]Feng Ming Dong, Khee Meng Koh:
Bounds For The Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. 17(6): 749-759 (2008) - [j33]Feng Ming Dong, Khee Meng Koh:
Domination numbers and zeros of chromatic polynomials. Discret. Math. 308(10): 1930-1940 (2008) - [j32]Feng Ming Dong, Khee Meng Koh:
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. Discret. Math. 308(11): 2285-2287 (2008) - [j31]Khee Meng Koh, Chyan-Yee Goh, Feng Ming Dong:
The maximum number of maximal independent sets in unicyclic connected graphs. Discret. Math. 308(17): 3761-3769 (2008) - [j30]Feng Ming Dong, Khee Meng Koh:
On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). Discret. Math. 308(17): 3897-3905 (2008) - 2007
- [j29]Feng Ming Dong, Khee Meng Koh:
Bounds for the coefficients of flow polynomials. J. Comb. Theory B 97(3): 413-420 (2007) - 2006
- [j28]Feng Ming Dong, Khee Meng Koh:
On Graphs Having No Chromatic Zeros in (1, 2). SIAM J. Discret. Math. 20(3): 799-810 (2006) - 2005
- [j27]Feng Ming Dong:
Further results on the lower bounds of mean color numbers. J. Graph Theory 48(1): 51-73 (2005) - 2004
- [j26]Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little:
Graph-functions associated with an edge-property. Australas. J Comb. 30: 3-20 (2004) - [j25]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh:
Chromatically Unique Multibridge Graphs. Electron. J. Comb. 11(1) (2004) - [j24]Feng Ming Dong, Khee Meng Koh:
Two Results on Real Zeros of Chromatic Polynomials. Comb. Probab. Comput. 13(6): 809-813 (2004) - [j23]Feng Ming Dong, Khee Meng Koh, C. A. Soh:
Divisibility of certain coefficients of the chromatic polynomials. Discret. Math. 275(1-3): 311-317 (2004) - [j22]Feng Ming Dong, Khee Meng Koh:
On upper bounds for real roots of chromatic polynomials. Discret. Math. 282(1-3): 95-101 (2004) - [j21]Feng Ming Dong:
The largest non-integer real zero of chromatic polynomials of graphs with fixed order. Discret. Math. 282(1-3): 103-112 (2004) - 2003
- [j20]Feng Ming Dong:
Bounds for mean colour numbers of graphs. J. Comb. Theory B 87(2): 348-365 (2003) - 2002
- [j19]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Two invariants for adjointly equivalent graphs. Australas. J Comb. 25: 133-144 (2002) - [j18]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Zeros of adjoint polynomials of paths and cycles. Australas. J Comb. 25: 167-174 (2002) - [j17]Feng Ming Dong, Kee L. Teo, Khee Meng Koh:
A note on the chromaticity of some 2-connected (n, n+3)-graphs. Discret. Math. 243(1-3): 217-221 (2002) - [j16]Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy:
Non-chordal graphs having integral-root chromatic polynomials II. Discret. Math. 245(1-3): 247-253 (2002) - [j15]Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little:
The vertex-cover polynomial of a graph. Discret. Math. 250(1-3): 71-78 (2002) - [j14]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Chromaticity of some families of dense graphs. Discret. Math. 258(1-3): 303-321 (2002) - 2001
- [j13]Feng Ming Dong, Khee Meng Koh, Kee L. Teo:
Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs. Graphs Comb. 17(4): 611-635 (2001) - [j12]Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy:
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. J. Graph Theory 37(1): 48-77 (2001) - 2000
- [j11]Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
An attempt to classify bipartite graphs by chromatic polynomials. Discret. Math. 222(1-3): 73-88 (2000) - [j10]Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Chromatically unique bipartite graphs with low 3-independent partition numbers. Discret. Math. 224(1-3): 107-124 (2000) - [j9]Feng Ming Dong:
Proof of a Chromatic Polynomial Conjecture. J. Comb. Theory B 78(1): 35-44 (2000)
1990 – 1999
- 1999
- [j8]Feng Ming Dong, Khee Meng Koh:
Structures and chromaticity of some extremal 3-colourable graphs. Discret. Math. 203(1-3): 71-82 (1999) - 1998
- [j7]Feng Ming Dong, Y. P. Liu:
All wheels with two missing consecutive spokes are chromatically unique. Discret. Math. 184(1-3): 71-85 (1998) - 1997
- [j6]Feng Ming Dong, Khee Meng Koh:
On graphs in which any pair of colour classes but one induces a tree. Discret. Math. 169(1-3): 39-54 (1997) - [j5]Feng Ming Dong, Khee Meng Koh:
On the structure and chromaticity of graphs in which any two colour classes induce a tree. Discret. Math. 176(1-3): 97-113 (1997) - 1996
- [j4]Feng Ming Dong, Y. P. Liu:
On the chromatic uniqueness of the graphW(n, n - 2, k). Graphs Comb. 12(1): 221-230 (1996) - 1995
- [j3]Feng Ming Dong, Yanpei Liu:
On the chromatic uniqueness of the graph W(n, n-2) + Kk. Discret. Math. 145(1-3): 95-103 (1995) - 1993
- [j2]Feng Ming Dong, Yanpei Liu:
Counting rooted near-triangulations on the sphere. Discret. Math. 123(1-3): 35-45 (1993) - [j1]Feng Ming Dong:
On chromatic uniqueness of two infinite families of graphs. J. Graph Theory 17(3): 387-392 (1993)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
