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.

MinimumChangePermutations[l] constructs all permutations of list l such that adjacent permutations differ by only one transposition.

MinimumVertexColoring[g] returns a minimum vertex coloring of g. MinimumVertexColoring[g, k] returns a k-coloring of g, if one exists.

MultipleEdgesQ[g] yields True if g has multiple edges between pairs of vertices. It yields False otherwise.

MultiplicationTable[l, f] constructs the complete transition table defined by the binary relation function f on the elements of list l.

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.