On essential components and critical sets of a graph Original Research Article

We introduce some new concepts, which generalize the concepts of critical edge and critical component, and investigate their relation with α-coverings of a graph, perfect graphs and the Strong Perfect Graph Conjecture. Most of the obtained results can be viewed either as analogues or generalizations of well-known properties of holes and (α, ω)-graphs. A number of open problems is also suggested.