1 paper
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.…