Xiaozheng Chen

most citedProper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles

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

collaborators

4 papers

math.CO2023

Short rainbow cycles in edge-colored graphs

Xiaozheng Chen, Shanshan Guo, Fei Huang

A famous conjecture of Caccetta and Häggkvist (CHC) states that a directed graph $D$ with $n$ vertices and minimum outdegree at least $r$ has a directed cycle of length at most $\l…

math.CO2020

Rainbow triangles in edge-colored complete graphs

Xiaozheng Chen, Xueliang Li

Let $G$ be a graph of order $n$ with an edge-coloring $c$ , and let $δ^{c} (G)$ denote the minimum color-degree of $G$ . A subgraph $F$ of $G$ is called rainbow if any two edges of $F$ …

math.CO2020

Note on rainbow cycles in edge-colored graphs

Xiaozheng Chen, Xueliang Li

Let $G$ be a graph of order $n$ with an edge-coloring $c$ , and let $δ^{c} (G)$ denote the minimum color degree of $G$ . A subgraph $F$ of $G$ is called rainbow if all edges of $F$ have…

math.CO2020★ 2 cited

Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles

Xiaozheng Chen, Xueliang Li

In an edge-colored graph $(G, c)$ , let $d^{c} (v)$ denote the number of colors on the edges incident with a vertex $v$ of $G$ and $δ^{c} (G)$ denote the minimum value of $d^{c} (v)$ over all…