Author(s)

Hatem Najar^1,2, Riadh Gargouri²

¹Department of Mathematics, Faculty of Sciences of Monastir, Monastir, Tunisia.
²Department of Mathematics, College of Sciences, Taibah University, Madina, Saudi Arabia.

In this study, we consider the problem of triangulated graphs. Precisely we give a necessary and sufficient condition for a graph to be triangulated. This gives an alternative characterization of triangulated graphs. Our method is based on the so-called perfectly nested sequences.

Triangulated Graphs, Perfect Set, Clique

Najar, H. and Gargouri, R. (2023) A Remark on the Characterization of Triangulated Graphs. Open Journal of Discrete Mathematics, 13, 55-62. doi: 10.4236/ojdm.2023.132006.