Edge-critical graph

Edge-critical graph --- реберно-критический граф.

A graph [math]\displaystyle{ G }[/math] is called edge-critical with respect to a property [math]\displaystyle{ P }[/math] if [math]\displaystyle{ G }[/math] has it but, on removing any edge, the resulting graph will not have the property [math]\displaystyle{ P }[/math]. Point-critical is defined analogously.