On a k-clique-join of a class of partitionable graphs

Abstract

We call a graph G O-graph if there is an optimal coloring of the set of vertices and an optimal (disjoint) covering with cliques such that any class of colors intersects any clique. In this paper, it has been established the relation to [p,q,r]-partite graphs and the fact that the O-graphs admit a k-clique-join. American Mathematical Society (2000): 05C17.

Keywords

• Perfect graphs
• (α
• ω)-partitionable graphs
• [p
• q
• r]-partite graphs
• k-clique-join.