Abstract

A graph G is called perfect if the chromatic number and the clique number have the same value for every of its
induced subgraph. A glued graph results from combining two vertex-disjoint graphs by identifying connected
isomorphic subgraphs of both graphs. Such subgraphs are referred to as the clones.
We study the perfection of glued graphs whose clones are complete graphs. Our result generalizes the simplicial
elimination ordering which is a characterization of chordal graphs.

This work is licensed under a Creative Commons Attribution 4.0 License.