文章基本信息

标题：On a k-clique-join of a class of partitionable graphs
本地全文：下载
作者：Mihai Talmaciu
期刊名称：Computer Science Journal of Moldova
印刷版ISSN：1561-4042
出版年度：2005
卷号：13
期号：1
页码：37-46
出版社：Institute of Mathematics and Computer Science
摘要：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.
关键词：Perfect graphs; (α; ω)-partitionable graphs; [p;q;r]-partite graphs; k-clique-join.