Article citationsMore>>

Asdre, K. and Nikolopoulos, S.D. (2007) NP-Completeness Results for Some Problems on Subclasses of Bipartite and Chordal Graphs. Theoretical Computer Science, 381, 248-259.
https://doi.org/10.1016/j.tcs.2007.05.012

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.