IndependentSetQ[g, i] yields True if the vertices in list i define an independent set in graph g.

InduceSubgraph[g, s] constructs the subgraph of graph g induced by the list of vertices s.

IntervalGraph[l] constructs the interval graph defined by the list of intervals l.

LexicographicPermutations[l] constructs all permutations of list l in lexicographic order.

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

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

NextKSubset[l, s] gives the k-subset of list l, following the k-subset s in lexicographic order.

NthSubset[n, l] gives the n\[Null]^th subset of list l in canonical order.

PermutationGroupQ[l] yields True if the list of permutations l forms a permutation group.

UnrankKSubset[m, k, l] gives the m\[Null]^th k-subset of set l, listed in lexicographic order.