MaximalMatching (Combinatorica Package Symbol)

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

MaximumAntichain (Combinatorica Package Symbol)

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

MaximumIndependentSet (Combinatorica Package Symbol)

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

MaximumSpanningTree (Combinatorica Package Symbol)

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

McGeeGraph (Combinatorica Package Symbol)

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

MinimumChainPartition (Combinatorica Package Symbol)

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

MycielskiGraph (Combinatorica Package Symbol)

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

NextComposition (Combinatorica Package Symbol)

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

NoPerfectMatchingGraph (Combinatorica Package Symbol)

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

NormalDashed (Combinatorica Package Symbol)

NormalDashed is a value that the option EdgeStyle can take on in the graph data structure or in ShowGraph.