  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
give an alternative characterization of triangulated graphs. Our method is
based on the so called perfectly nested sequences.
