A Problem on Clique Partitions of Regular Graphs
R.B. Ponsones, and F.J.H. Campeña (pp. 75-80)
Abstract
A clique partition of a simple graph G is a collection of complete subgraphs of G (called cliques) that partitions the edge set of G. The cardinality of a minimum clique partition number of G is called the clique partition number of G and is denoted by cp(G). This paper presents some approaches in determining integers x for which a graph G on n vertices with clique partition number x exists.