3 papers
math.CO2026
Decomposing multigraphs into two Class I subgraphs with prescribed maximum degrees
Yonglei Chen, Yan Cao
Let be a finite loopless multigraph with maximum degree and , where . We prove that for every pair of positive integers satisfying $$p+q=Δ+k\qquad\t…
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 -critical graph, at most one color is missing at more than one vertex.…
math.CO2022
Spectral radius conditions for fractional -covered graphs
Junjie Wang, Jiaxin Zheng, Yonglei Chen
A graph is called fractional -covered if for every edge of there is a fractional -factor with the indicator function such that . In this paper…