05589700

j

05589700 Uiyyasathian, Chariya Saduakdee, Supaporn Perfect glued graphs at complete clones. J. Math. Res. 1, No. 1, 25-30 (2009). 2009 Canadian Center of Science and Education (CCSE), Toronto, ON EN perfect graphs glued graphs Summary: 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.