| Publication | Date of Publication | Type |
|---|
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
(available as arXiv preprint) | N/A | Paper |
| Chromatically equivalent chordal graphs | 2026-02-10 | Paper |
Non-persistence of equality between chromatic polynomials and list-color functions
(available as arXiv preprint) | 2026-01-01 | Paper |
Real-rooted flow polynomials have only integral roots
(available as arXiv preprint) | 2026-01-01 | Paper |
When chromatic polynomials coincide with list-color functions: a threshold linear in the maximum degree
(available as arXiv preprint) | 2026-01-01 | Paper |
A study on T-equivalent graphs
Advances in Applied Mathematics | 2025-12-18 | Paper |
A study on T-equivalent graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
A sharp upper bound for the number of connected sets in any grid graph
(available as arXiv preprint) | 2025-01-01 | Paper |
The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices
(available as arXiv preprint) | 2025-01-01 | Paper |
On the enumeration of connected sets in finite cylindrical lattice graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions
Discrete Mathematics | 2024-08-19 | Paper |
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials. II
Discrete Mathematics | 2023-10-30 | Paper |
DP color functions versus chromatic polynomials (II)
Journal of Graph Theory | 2023-10-10 | Paper |
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-10 | Paper |
| On the colorability of bi-hypergraphs | 2023-10-10 | Paper |
| The absolute values of the perfect matching derangement graph's eigenvalues almost follow the lexicographic order of partitions | 2023-05-06 | Paper |
| Compare list-color functions of hypergraphs with their chromatic polynomials (I) | 2023-05-03 | Paper |
An improved lower bound of P(G,L)-P(G,k) for k-assignments L
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
(available as arXiv preprint) | 2023-01-01 | Paper |
On the colorability of bi-hypergraphs
(available as arXiv preprint) | 2023-01-01 | Paper |
Anti-Ramsey numbers for trees in complete multi-partite graphs
Discrete Mathematics | 2022-09-26 | Paper |
| Results on two kinds of Steiner distance-based indices for some classes of graphs | 2021-11-15 | Paper |
| scientific article; zbMATH DE number 7410894 (Why is no real title available?) | 2021-10-18 | Paper |
| $Z_{DP}(n)$ is upperly bounded by $n^2-(n+3)/2$ | 2021-07-19 | Paper |
$Z_{DP}(n)$ is upperly bounded by $n^2-(n+3)/2$
(available as arXiv preprint) | 2021-01-01 | Paper |
The minimal coloring number of any non-splittable \(\mathbb Z\)-colorable link is four
Journal of Knot Theory and Its Ramifications | 2017-12-01 | Paper |
