张美乔

2025

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

Discrete Mathematics

DOI

2025

The burning number conjecture holds for trees of order n with at most n-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document

Graphs and Combinatorics

DOI

On generalized colorings and color functions of graphs and hypergraphs

DOI

2026

When chromatic polynomials coincide with list-color functions: a threshold linear in the maximum degree

arXiv preprint

2026

Non-persistence of equality between chromatic polynomials and list-color functions

arXiv preprint

2025

On the enumeration of connected sets in finite cylindrical lattice graphs

arXiv preprint

2025

A study on $T$-equivalent graphs

arXiv preprint

2023

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

arXiv preprint

2023

On the colorability of bi-hypergraphs

arXiv preprint

2022

An improved lower bound of $P(G, L)-P(G,k)$ for $k$-assignments $L$

arXiv preprint

DOI

2022

DP color functions versus chromatic polynomials (II)

arXiv preprint

2021

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

arXiv preprint

2021

$Z_{DP}(n)$ is upperly bounded by $n^2-(n+3)/2$

arXiv preprint