Article citationsMore>>

Tarjan, R.E. and Yannakakis, M. (1984) Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs. SIAM Journal on Computing, 13, 566-579.
https://doi.org/10.1137/0213035

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.