Xueli Su

activity

20202024

most citedGallai-Ramsey numbers for monochromatic

K_{4}^{+}

K_{3}

1 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing math.COShow all

4 papers · 1 filter

math.CO2024

The absence of monochromatic triangle implies various properly colored spanning trees

Ruonan Li, Ruhui Lu, Xueli Su +1

An edge-colored graph $G$ is called properly colored if every two adjacent edges are assigned different colors. A monochromatic triangle is a cycle of length 3 with all the edges h…

math.CO2021★ 1 cited

Star-critical Gallai-Ramsey numbers of graphs

Xueli Su, Yan Liu

The Gallai-Ramsey number $g r_{k} (K_{3} : H_{1}, H_{2}, \dots, H_{k})$ is the smallest integer $n$ such that every $k$ -edge-colored $K_{n}$ contains either a rainbow $K_{3}$ or a mono…

math.CO2020

Gallai-Ramsey numbers for graphs with five vertices and eight edges

Xueli Su, Yan Liu

A Gallai $k$ -coloring is a $k$ -edge coloring of a complete graph in which there are no rainbow triangles. For given graphs $G_{1}, G_{2}, G_{3}$ and nonnegative integers $r, s, t$ with t…

math.CO2020★ 1 cited

Gallai-Ramsey numbers for monochromatic $K_{4}^{+}$ or $K_{3}$

Xueli Su, Yan Liu

A Gallai $k$ -coloring is a $k$ -edge coloring of a complete graph in which there are no rainbow triangles. For two given graphs $H, G$ and two positive integers $k, s$ with that $s\l…

The absence of monochromatic triangle implies various properly colored spanning trees

Star-critical Gallai-Ramsey numbers of graphs

Gallai-Ramsey numbers for graphs with five vertices and eight edges

Gallai-Ramsey numbers for monochromatic K4+​ or K3​

Gallai-Ramsey numbers for monochromatic $K_{4}^{+}$ or $K_{3}$