KSubsets[l, k] gives all subsets of set l containing exactly k elements, ordered lexicographically.

LabeledTreeToCode[g] reduces the tree g to its Prüfer code.

LastLexicographicTableau[p] constructs the last Young tableau with shape described by partition p.

LeviGraph returns the unique (8, 3)-cage, a 3-regular graph whose girth is 8.

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

LexicographicSubsets[l] gives all subsets of set l in lexicographic order. LexicographicSubsets[n] returns all subsets of {1, 2, ..., n} in lexicographic order.

LineGraph[g] constructs the line graph of graph g.

ListGraphs[n, m] returns all nonisomorphic undirected graphs with n vertices and m edges. ListGraphs[n, m, Directed] returns all nonisomorphic directed graphs with n vertices ...

ListNecklaces[n, c, Cyclic] returns all distinct necklaces whose beads are colored by colors from c. Here c is a list of n, not necessarily distinct colors, and two colored ...

LNorm[p] is a value that the option WeightingFunction, used in the function SetEdgeWeights, can take. Here p can be any integer or Infinity.