Fengming Dong

From MaRDI portal
Person:490408

Available identifiers

zbMath Open dong.fengmingMaRDI QIDQ490408

List of research outcomes

PublicationDate of PublicationType
A new note on 1-planar graphs with minimum degree 72024-03-27Paper
Introduction to Graph Theory2023-11-08Paper
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II2023-10-30Paper
DP color functions versus chromatic polynomials (II)2023-10-10Paper
ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$2023-10-10Paper
Zip product of graphs and crossing numbers2023-09-29Paper
An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)2023-05-02Paper
Foundations of the chromatic polynomial2023-04-28Paper
On the Size of Matchings in 1-Planar Graph with High Minimum Degree2022-11-09Paper
Proving identities on weight polynomials of tiered trees via Tutte polynomials2022-10-14Paper
New upper bounds for the crossing numbers of crossing-critical graphs2022-09-26Paper
Anti-Ramsey numbers for trees in complete multi-partite graphs2022-09-26Paper
DP color functions versus chromatic polynomials2022-01-21Paper
Problems on chromatic polynomials of hypergraphs2021-09-06Paper
The maximal 1-planarity and crossing numbers of graphs2021-07-28Paper
On the sizes of bipartite 1-planar graphs2021-06-07Paper
Properties of \(\pi\)-skew graphs with applications2021-05-11Paper
Zero-free intervals of chromatic polynomials of hypergraphs2020-10-08Paper
A survey on the study of real zeros of flow polynomials2020-07-17Paper
New expressions for order polynomials and chromatic polynomials2020-05-21Paper
The rank of a complex unit gain graph in terms of the matching number2020-04-21Paper
On the skewness of Cartesian products with trees2019-09-05Paper
From G-parking functions to B-parking functions2018-09-07Paper
On graphs whose flow polynomials have real roots only2018-08-15Paper
A study on rank commutators of special families of matrices2018-07-18Paper
Even subgraph expansions for the flow polynomial of planar graphs with maximum degree at most 42018-05-25Paper
A note on distance spectral radius of trees2018-02-16Paper
On the largest outscribed equilateral triangle2017-09-01Paper
Expression for the Number of Spanning Trees of Line Graphs of Arbitrary Connected Graphs2017-06-30Paper
Properties of chromatic polynomials of hypergraphs not held for chromatic polynomials of graphs2017-06-23Paper
https://portal.mardi4nfdi.de/entity/Q34624202016-01-14Paper
Zeros of Jones polynomials of graphs2015-08-27Paper
Graph Theory2015-04-07Paper
The chromatic equivalence class of \(K_{1, n, n + 2}\)2015-01-30Paper
The effect of a graft transformation on distance spectral radius2014-07-21Paper
https://portal.mardi4nfdi.de/entity/Q28694692014-01-03Paper
On the number of perfect matchings of line graphs2013-04-18Paper
The 3-connectivity of a graph and the multiplicity of zero “2” of its chromatic polynomial2012-07-10Paper
A Zero-Free Interval for Chromatic Polynomials of Nearly 3-Connected Plane Graphs2012-03-15Paper
On atom-bond connectivity index of connected graphs2011-10-27Paper
On Zero-Free Intervals in $(1,2)$ of Chromatic Polynomials of Some Families of Graphs2011-04-15Paper
Zeros of the Jones polynomial are dense in the complex plane2010-08-12Paper
On graphs determining links with maximal number of components via medial construction2010-04-28Paper
DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES2010-01-25Paper
https://portal.mardi4nfdi.de/entity/Q58513962010-01-21Paper
Bounds For The Real Zeros of Chromatic Polynomials2009-03-04Paper
Domination numbers and zeros of chromatic polynomials2008-11-12Paper
The maximum number of maximal independent sets in unicyclic connected graphs2008-07-11Paper
On planar and non-planar graphs having no chromatic zeros in the interval(1,2)2008-07-11Paper
A maximal zero-free interval for chromatic polynomials of bipartite planar graphs2008-04-28Paper
https://portal.mardi4nfdi.de/entity/Q53861712008-04-21Paper
On Graphs Having No Chromatic Zeros in (1,2)2007-09-06Paper
Bounds for the coefficients of flow polynomials2007-04-16Paper
https://portal.mardi4nfdi.de/entity/Q53132912005-08-26Paper
Two Results on Real Zeros of Chromatic Polynomials2005-02-18Paper
https://portal.mardi4nfdi.de/entity/Q48205232004-10-15Paper
On upper bounds for real roots of chromatic polynomials2004-08-06Paper
Chromatically unique multibridge graphs2004-02-05Paper
Divisibility of certain coefficients of the chromatic polynomials.2004-02-02Paper
Chromaticity of some families of dense graphs2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q45295182002-09-20Paper
The vertex-cover polynomial of a graph2002-08-29Paper
Structures and chromaticity of extremal 3-colourable sparse graphs2002-07-14Paper
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs2002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q45295202002-06-10Paper
Non-chordal graphs having integral-root chromatic polynomials. II2002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q27782642002-03-13Paper
A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs2002-03-13Paper
Chromatically unique bipartite graphs with low 3-independent partition numbers2001-06-28Paper
An attempt to classify bipartite graphs by chromatic polynomials2000-09-14Paper
https://portal.mardi4nfdi.de/entity/Q44956892000-08-10Paper
https://portal.mardi4nfdi.de/entity/Q49448272000-03-22Paper
Structures and chromaticity of some extremal 3-colourable graphs2000-03-13Paper
On the structure and chromaticity of graphs in which any two colour classes induce a tree1998-08-11Paper
https://portal.mardi4nfdi.de/entity/Q43797441998-03-04Paper
On graphs in which any pair of colour classes but one induces a tree1997-10-20Paper
https://portal.mardi4nfdi.de/entity/Q47170301997-08-18Paper
https://portal.mardi4nfdi.de/entity/Q43460401997-07-28Paper
On the chromatic uniqueness of the graph \(W(n,n-2,k)\)1996-10-13Paper
On the chromatic uniqueness of the graph \(W(n,n-2)+K_ k\)1996-04-23Paper
Counting rooted near-triangulations on the sphere1994-03-01Paper
On chromatic uniqueness of two infinite families of graphs1993-08-24Paper
https://portal.mardi4nfdi.de/entity/Q52895801993-08-23Paper
https://portal.mardi4nfdi.de/entity/Q39743001992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q57539761989-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Fengming Dong