LowerLeft is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

LowerRight is a value that options VertexNumberPosition, VertexLabelPosition, and EdgeLabelPosition can take on in ShowGraph.

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.

MaximumIndependentSet[g] finds a largest independent set of graph g.

MaximumSpanningTree[g] uses Kruskal's algorithm to find a maximum spanning tree of graph g.

McGeeGraph returns the unique (7, 3)-cage, a 3-regular graph with girth 7.

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

MycielskiGraph[k] returns a triangle-free graph with chromatic number k, for any positive integer k.

NextComposition[l] constructs the integer composition that follows l in a canonical order.