Haojie Zheng

collaborators

3 papers

math.CO2026

Anti-Ramsey Number of Intersecting Odd Cycles

Haojie Zheng

For a graph $H$ , the anti-Ramsey number $ar (n, H)$ is the maximum number of colors in an edge-coloring of $K_{n}$ containing no rainbow copy of $H$ , where a copy is rai…

math.CO2024

Characterization of Equimatchable Even-Regular Graphs

Xiao Zhao, Haojie Zheng, Fengming Dong +2

The study of equimatchable graphs traces back to Sumner (1979), followed by the foundational work of Lesk, Plummer, and Pulleyblank in 1984. Regarding the characterization of equim…

math.CO2024

The $K_{1, 2}$ -structure-connectivity of graphs

Xiao Zhao, Haojie Zheng, Hengzhe Li

In this paper, we mainly investigate $K_{1, 2}$ -structure-connectivity for any connected graph. Let $G$ be a connected graph with $n$ vertices, we show that $κ (G; K_{1, 2})$ is well-…

Anti-Ramsey Number of Intersecting Odd Cycles

Characterization of Equimatchable Even-Regular Graphs

The K1,2​-structure-connectivity of graphs

The $K_{1, 2}$ -structure-connectivity of graphs