摘要
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.
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.
作者
Hatem Najar
Riadh Gargouri
Hatem Najar;Riadh Gargouri(Department of Mathematics, Faculty of Sciences of Monastir, Monastir, Tunisia;Department of Mathematics, College of Sciences, Taibah University, Madina, Saudi Arabia)
