Proof of a conjectured lower bound on the chromatic number of a graph

We confirm a conjecture in Wocjan and Elphick (2013) [4] about a lower bound of the chromatic number of a graph.