AntiSymmetricQ[g] yields True if the adjacency matrix of g represents an anti-symmetric binary relation.

Backtrack[s, partialQ, solutionQ] performs a backtrack search of the state space s, expanding a partial solution so long as partialQ is True and returning the first complete ...

BiconnectedQ[g] yields True if graph g is biconnected. If g is directed, the underlying undirected graph is used.

BipartiteMatchingAndCover[g] takes a bipartite graph g and returns a matching with maximum weight along with the dual vertex cover. If the graph is not weighted, it is ...

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

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.

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.

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

CubeConnectedCycle[d] returns the graph obtained by replacing each vertex in a d-dimensional hypercube by a cycle of length d. Cube-connected cycles share many properties ...

Cycle[n] constructs the cycle on n vertices, the 2-regular connected graph. An option Type that takes on values Directed or Undirected is allowed. The default setting is Type ...