1 citations · 1 across the 7 of their papers we have counts for
15 papers
Anti-Ramsey numbers for trees in complete multi-partite graphs
Meiqiao Zhang, Fengming Dong
Let be a complete multi-partite graph of order . In this paper, we consider the anti-Ramsey number with respect to and the set …
is upperly bounded by
Meiqiao Zhang, Fengming Dong
DP-coloring was introduced by Dvořák and Postle and is a generalization of proper coloring. For any graph , let and denote the chromatic number and the DP-chr…
Express the number of spanning trees in term of degrees
Fengming Dong, Jun Ge, Zhangdong Ouyang
It is well-known that the number of spanning trees, denoted by , in a connected multi-graph can be calculated by the Matrix-Tree theorem and Tutte's deletion-contraction…
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…
Polynomials related to chromatic polynomials
Fengming Dong
For a simple graph , let denote the chromatic polynomial of . This manuscript introduces some polynomials which are related to chromatic polynomial and their relatio…
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…