A Generalization of Slightly Triangulated Graphs

Abstract

... In this paper, we introduce a wider class of graphs, obtained by relaxing the neighbourhood condition. We also provide polynomial algorithms to recognize and to produce an optimal coloring of a subclass of slightly triangulated graphs