Meiqiao Zhang

According to our database, Meiqiao Zhang authored at least 9 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2026

The burning number conjecture holds for trees of order n with at most $\left\lfloor \sqrt{n-1}\right\rfloor $ degree-2 vertices.

Jiajun Ning, Xian'an Jin, Meiqiao Zhang

Graphs Comb., April, 2026

A sharp upper bound for the number of connected sets in any grid graph.

Hongxia Ma, Xian'an Jin, Weiling Yang, Meiqiao Zhang

Discret. Math., 2026

A study on T-equivalent graphs.

Fengming Dong, Meiqiao Zhang

Adv. Appl. Math., 2026

2024

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (II).

Meiqiao Zhang, Fengming Dong

Discret. Math., January, 2024

The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions.

Meiqiao Zhang, Fengming Dong

Discret. Math., 2024

2023

ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2-(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$.

Meiqiao Zhang, Fengming Dong

J. Graph Theory, September, 2023

DP color functions versus chromatic polynomials (II).

Meiqiao Zhang, Fengming Dong

J. Graph Theory, August, 2023

An improved lower bound of <i>P</i>(<i>G</i>,<i>L</i>)-<i>P</i>(<i>G</i>,<i>k</i>) for <i>k</i>-assignments <i>L</i>.

Fengming Dong, Meiqiao Zhang

J. Comb. Theory B, July, 2023

2022

Anti-Ramsey numbers for trees in complete multi-partite graphs.

Meiqiao Zhang, Fengming Dong

Discret. Math., 2022