Meiqiao Zhang

From MaRDI portal
Person:2675856



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions
Discrete Mathematics
2024-08-19Paper
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II
Discrete Mathematics
2023-10-30Paper
DP color functions versus chromatic polynomials (II)
Journal of Graph Theory
2023-10-10Paper
ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$
Journal of Graph Theory
2023-10-10Paper
On the colorability of bi-hypergraphs2023-10-10Paper
The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions2023-05-06Paper
Compare list-color functions of hypergraphs with their chromatic polynomials (I)2023-05-03Paper
An improved lower bound of \(P(G,L)-P(G,k)\) for \(k\)-assignments \(L\)
Journal of Combinatorial Theory. Series B
2023-05-02Paper
Anti-Ramsey numbers for trees in complete multi-partite graphs
Discrete Mathematics
2022-09-26Paper
Results on two kinds of Steiner distance-based indices for some classes of graphs2021-11-15Paper
scientific article; zbMATH DE number 7410894 (Why is no real title available?)2021-10-18Paper
$Z_{DP}(n)$ is upperly bounded by $n^2-(n+3)/2$2021-07-19Paper
The minimal coloring number of any non-splittable \(\mathbb Z\)-colorable link is four
Journal of Knot Theory and Its Ramifications
2017-12-01Paper
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Meiqiao Zhang