36 citations · 70 across the 26 of their papers we have counts for
6 papers · 1 filter
On the sizes of bipartite 1-planar graphs
Yuanqiu Huang, Zhangdong Ouyang, Fengming Dong
A graph is called -planar if it admits a drawing in the plane such that each edge is crossed at most once. Let be a bipartite 1-planar graph with () vertices and…
A Survey of Graph Polynomials Related to the Chromatic Polynomial
Fengming Dong
Introduced by Birkhoff in 1912 to study the four-color conjecture, the chromatic polynomial has become one of the most extensively studied graph polynomials. It is closely connecte…
A survey on the study of real zeros of flow polynomials
Fengming Dong
For a bridgeless graph , its flow polynomial is defined to be the function which counts the number of nonwhere-zero -flows on an orientation of whenever is a…
New upper bounds for the crossing numbers of crossing-critical graphs
Zongpeng Ding, Zhangdong Ouyang, Yuanqiu Huang +1
A graph is {-crossing-critical} if , but for each edge , where is the crossing number of . It is known that for any $k…
Proving identities on weight polynomials of tiered trees via Tutte polynomials
Fengming Dong, Sherry H. F. Yan
A {\it tiered graph} with tiers is a simple graph with $V\subseteq \brk{n}$, where $\brk{n}=\{1,2,\cdots,n\}$, and with a surjective map from to $\brk{m}$ su…
Upper bounds on the signed edge domination number of a graph
Fengming Dong, Jun Ge, Yan Yang
A signed edge domination function (or SEDF) of a simple graph is a function such that holds for each edge $e\in E…