Let be a color-critical graph with such that the subgraph of induced by the vertices of degree has clique number at most . We prove that then either and or and , where is a special graph with and . This result for improves a case of a theorem by Rabern (2012) [9] and for answers a question raised by Kierstead and Kostochka (2009) in [6].