Yan Cao

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2025

Short Brooms in Edge-chromatic Critical Graphs

Yonglei Chen, Yan Cao

This paper studies short brooms in edge-chromatic critical graphs. We prove that for any short broom in a $I^$ -critical graph, at most one color is missing at more than one vertex.…

math.CO2024

Pseudo-multifan and Lollipop

Yan Cao, Guantao Chen, Guangming Jing +1

A simple graph $G$ with maximum degree $I^$ is \emph{overfull} if $∣ E (G) ∣ > I^ ⌊ ∣ V (G) ∣/2 ⌋$ . The \emph{core} of $G$ , denoted $G_{I^} $ , is the subgraph of $G$ induced by its…