Hajós-Type Constructions and Neighborhood Complexes

Any graph $G$ with chromatic number $k$ can be obtained using a Hajos-type construction, i.e., by iteratively performing the Hajos merge and vertex identification operations on a sequence of graphs...