1 problem

Let $G$ be a graph with maximum degree $\Delta(G)$ and vertex set $V(G)$. A graph is overfull if $|E(G)|>\Delta(G)\lfloor |V(G)|/2\rfloor$, and a graph is Class 2 if its chromatic…