ABSTRACT
In this chapter, the authors present an introduction to the minimal clique partitions of norm. They assume a basic familiarity with graph theory. All graphs that they deal with are finite and simple. A clique partition of graph is a collection of cliques such that each edge of graph is contained in exactly one clique in the collection. The norm of a clique partition is the number of vertices contained in a largest clique. N. J. Pullman noted that graphs can have a very large number of edges and yet admit minimal clique partitions of norm 3. Specifically, he notes that for each positive integer n, one can construct graphs on n vertices and as many as 3n2 /8 edges having this property. The authors provide preliminary results and main results with theorems and proofs.
