A lower bound on the chromatic number of Mycielski graphs Original Research Article

In this work we give a new lower bound on the chromatic number of a Mycielski graph Mi. The result exploits a mapping between the coloring problem and a multiprocessor task scheduling problem. The tightness of the bound is proved for i=1,…,8.