1 Answers
In graph theory, a critical graph is a graph G in which every vertex or edge is a critical element, that is, if its deletion decreases the chromatic number of G. Such a decrease cannot be by more than 1.
5 views
Answered