4 citations · 6 across the 14 of their papers we have counts for
15 papers
When chromatic polynomials coincide with list-color functions: a threshold linear in the maximum degree
Meiqiao Zhang, Fengming Dong
Let be a simple graph with maximum degree , and let denote its chromatic polynomial. For each positive integer , the list-color function is…
Real-rooted flow polynomials have only integral roots
Meiqiao Zhang, Fengming Dong
Let be a connected bridgeless graph. In 2011, Kung and Royle showed that all roots of the flow polynomial of are integers if and only if is the dual of a chord…
Non-persistence of equality between chromatic polynomials and list-color functions
Meiqiao Zhang, Fengming Dong
For any graph , let and denote the chromatic polynomial and the list-color function of , respectively. It remains an open problem whether, for every…
A study on -equivalent graphs
Fengming Dong, Meiqiao Zhang
In his article [J. Comb. Theory Ser. B 16 (1974), 168-174], Tutte called two graphs -equivalent (i.e., codichromatic) if they have the same Tutte polynomial and showed that grap…
On the colorability of bi-hypergraphs
Meiqiao Zhang, Fengming Dong, Ruixue Zhang
A {\it mixed hypergraph} consists of the vertex set and two families of subsets of : the family of co-edge…
The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions
Meiqiao Zhang, Fengming Dong
In 2013, Ku and Wong showed that for any partitions and of a positive integer with the same first part and the lexicographic order , the eigenva…