36 citations · 70 across the 26 of their papers we have counts for
5 papers · 1 filter
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…
DP color functions versus chromatic polynomials
Fengming Dong, Yan Yang
For any graph , the chromatic polynomial of is the function which counts the number of proper -colorings of for each positive integer . The DP color funct…
Counting spanning trees in a complete bipartite graph which contain a given spanning forest
Fengming Dong, Jun Ge
In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let be the…