CoarserSetPartitionQ[a, b] yields True if set partition b is coarser than set partition a; that is, every block in a is contained in some block in b.

CodeToLabeledTree[l] constructs the unique labeled tree on n vertices from the Prüfer code l, which consists of a list of n - 2 integers between 1 and n.

Cofactor[m, {i, j}] calculates the (i, j)\[Null]^th cofactor of matrix m.

CompleteBinaryTree[n] returns a complete binary tree on n vertices.

CompleteGraph[n] creates a complete graph on n vertices. An option Type that takes on the values Directed or Undirected is allowed. The default setting for this option is ...

CompleteKaryTree[n, k] returns a complete k-ary tree on n vertices.

CompleteKPartiteGraph[a, b, c, ...] creates a complete k-partite graph of the prescribed shape, provided the k arguments a, b, c, ... are positive integers. An option Type ...

CompleteQ[g] yields True if graph g is complete. This means that between any pair of vertices there is an undirected edge or two directed edges going in opposite directions.

Compositions[n, k] gives a list of all compositions of integer n into k parts.

ConnectedComponents[g] gives the vertices of graph g partitioned into connected components.