Complete \((k-1)\)-Subgraphs of \(k\)-Critical Graphs

A graph \(G\) is called \(k\)-critical if \(\chi(G) = k\) and \(\chi(G – e) k\) is at most \(n – k + 3\) if \(k \leq 7\).