Rose, D.J., Tarjan, R.E. and Lueker, G.S. (1976) Algorithmic Aspects of Vertex Elimination on Graphs. SIAM Journal on Computing, 5, 266-283. https://doi.org/10.1137/0205021
has been cited by the following article:
TITLE: A Remark on the Characterization of Triangulated Graphs
AUTHORS: Hatem Najar, Riadh Gargouri
KEYWORDS: Triangulated Graphs, Perfect Set, Clique
JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.13 No.2, April 28, 2023
ABSTRACT: 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.