A Note on Quasi‐triangulated Graphs

A graph is quasi‐triangulated if each of its induced subgraphs has a vertex which is either simplicial (its neighbors form a clique) or cosimplicial (its non...