The following pages link to Meiqiao Zhang (Q2675856):
Displaying 11 items.
- Anti-Ramsey numbers for trees in complete multi-partite graphs (Q2675857) (← links)
- The minimal coloring number of any non-splittable ℤ-colorable link is four (Q4596412) (← links)
- (Q5157505) (← links)
- (Q5165174) (← links)
- An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\) (Q6038583) (← links)
- DP color functions versus chromatic polynomials (II) (Q6047960) (← links)
- ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ (Q6047969) (← links)
- Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II (Q6080166) (← links)
- Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III) (Q6507230) (← links)
- The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions (Q6589148) (← links)
- A study on $T$-equivalent graphs (Q6763849) (← links)
