Perfect Glued Graphs at Complete Clones

Chariya Uiyyasathian, Supaporn Saduakdee


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.

Full Text:



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

Journal of Mathematics Research   ISSN 1916-9795 (Print)   ISSN 1916-9809 (Online)

Copyright © Canadian Center of Science and Education

To make sure that you can receive messages from us, please add the '' domain to your e-mail 'safe list'. If you do not receive e-mail in your 'inbox', check your 'bulk mail' or 'junk mail' folders.