Shanshan Guo

collaborators

3 papers

cs.DM2024

Conflict-free chromatic index of trees

Shanshan Guo, Ethan Y. H. Li, Luyi Li +1

A graph $G$ is conflict-free $k$ -edge-colorable if there exists an assignment of $k$ colors to $E (G)$ such that for every edge $e \in E (G)$ , there is a color that is assigned to exa…

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.CO2023

Properly colored even cycles in edge-colored complete balanced bipartite graphs

Shanshan Guo, Fei Huang, Jinjiang Yuan +2

Consider a complete balanced bipartite graph $K_{n, n}$ and let $K_{n, n}^{c}$ be an edge-colored version of $K_{n, n}$ that is obtained from $K_{n, n}$ by having each edge assigned a ce…