| Article ID: | iaor1994688 |
| Country: | Brazil |
| Volume: | 2 |
| Issue: | 3 |
| Start Page Number: | 245 |
| End Page Number: | 271 |
| Publication Date: | Jun 1992 |
| Journal: | Investigacin Operativa |
| Authors: | Villanueva M. |
In this work, the authors survey some different characterizations of triangulated graphs, describe sequential and parallel algorithms for recognizing them, for finding its intersection graph representation and solving the problems of minimum coloring and clique partition, as well as maximum clique and independent set. The focus is on triangulated graphs studied in the context of perfect graphs. Finally, the authors discuss some restrictions and extensions of this class.