MaximalMatching[g] gives the list of edges associated with a maximal matching of graph g.

MaximumAntichain[g] gives a largest set of unrelated vertices in partial order g.

MinimumChainPartition[g] partitions partial-order g into a minimum number of chains.

Neighborhood[g, v, k] returns the subset of vertices in g that are at a distance of k or less from vertex v. Neighborhood[al, v, k] behaves identically, except that it takes ...

NoPerfectMatchingGraph returns a connected graph with 16 vertices that contains no perfect matching.

NumberOf2Paths[g, v] returns a sorted list that contains the number of paths of length 2 to different vertices of g from v.

NumberOfSpanningTrees[g] gives the number of labeled spanning trees of graph g.

ParentsToPaths[l, i, j] takes a list of parents l and returns the path from i to j encoded in the parent list. ParentsToPaths[l, i] returns the paths from i to all vertices.

Radius[g] gives the radius of graph g, the minimum eccentricity of any vertex of g.

ResidualFlowGraph[g, flow] returns the directed residual flow graph for graph g with respect to flow.