Paper Info
Title
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.
Year
Venue
Keywords
2005
COMPUTER SCIENCE JOURNAL OF MOLDOVA
perfect graphs, (alpha,w)-partitionable graphs, [p,q,r]-partite graphs, k-clique-join
Field
DocType
Volume
Discrete mathematics,Complete coloring,Combinatorics,Disjoint sets,Clique graph,Fractional coloring,Clique,Clique-sum,Independent set,Clique (graph theory),Mathematics
Journal
13
Issue
ISSN
Citations 
1
1561-4042
0
PageRank 
References 
Authors
0.34
1
1
Name
Order
Citations
PageRank
Mihai Talmaciu142.83