2 citations · 2 across the 4 of their papers we have counts for
5 papers · 1 filter
Cycle lengths and chords under chromatic and degree constraints
Xiaozheng Chen, Bo Ning
We mainly consider three problems on cycle lengths and cycles with chords in graphs: (a) Gao, Huo, and Ma \cite[Question~1.5]{GaoHuoMa2021} asked whether, for every fixed ,…
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 with vertices and minimum outdegree at least has a directed cycle of length at most $\l…
Rainbow triangles in edge-colored complete graphs
Xiaozheng Chen, Xueliang Li
Let be a graph of order with an edge-coloring , and let denote the minimum color-degree of . A subgraph of is called rainbow if any two edges of …
Note on rainbow cycles in edge-colored graphs
Xiaozheng Chen, Xueliang Li
Let be a graph of order with an edge-coloring , and let denote the minimum color degree of . A subgraph of is called rainbow if all edges of have…
Proper vertex-pancyclicity of edge-colored complete graphs without joint monochromatic triangles
Xiaozheng Chen, Xueliang Li
In an edge-colored graph , let denote the number of colors on the edges incident with a vertex of and denote the minimum value of over all…