Applying the Mycielskian repeatedly, starting with a graph with a single edge, produces a sequence of graphs Mi = μ(Mi-1), also sometimes called the Mycielski graphs.
In general, the graphs Mi in this sequence are triangle-free, (i-1)-vertex-connected, and i-chromatic.