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 $\Delta$-critical graph, at most one color is missing at more than one vertex.…