A remark on the characterization of triangulated graphs
Combinatorics
2018-11-21 v1 Functional Analysis
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 give an alternative characterization of triangulated graphs. Our method is based on the so called perfectly nested sequences.
Cite
@article{arxiv.1811.08411,
title = {A remark on the characterization of triangulated graphs},
author = {R. Gargouri and H. Najar},
journal= {arXiv preprint arXiv:1811.08411},
year = {2018}
}
Comments
14 pages, 4 figures