The pseudoachromatic number of a graph
The pseudoachromatic number of a graph \(G\) is the maximum size of a vertex partition of \(G\) (where the sets of the partition may or may not be independent) such that, between any two distinct parts, there is at least one edge of \(G\). In this paper this new parameter is determined for cycles, paths, wheels and certain complete multipartite graphs. Some open problems are raised.
scientific article; zbMATH DE number 1533402