BipartiteQ[g] yields True if graph g is bipartite.

BrelazColoring[g] returns a vertex coloring in which vertices are greedily colored with the smallest available color in decreasing order of vertex degree.

ChromaticNumber[g] gives the chromatic number of the graph, which is the fewest number of colors necessary to color the graph.

ChvatalGraph returns a smallest triangle-free, 4-regular, 4-chromatic graph.

CircularEmbedding[n] constructs a list of n points equally spaced on a circle. CircularEmbedding[g] embeds the vertices of g equally spaced on a circle.

CliqueQ[g, c] yields True if the list of vertices c defines a clique in graph g.

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.