ХАРАКТЕРИЗАЦИЯ 1-ТРЕУГОЛЬНЫХ ГРАФОВ

A graph is called 1-triangle if for each maximal independent set I, each edge of this graph with both end vertices not belonging to I forms exactly one triangle with a vertex from the set I. We have obtained a structural characterization of 1-triangle graphs which implies a polynomial time recognition algorithm for this class of graphs.