This is documentation for Mathematica 6, which was
based on an earlier version of the Wolfram Language.
View current documentation (Version 11.1)
Combinatorica Package Tutorial
AcyclicQ AddEdge AddEdges AddVertex AddVertices Algorithm AllPairsShortestPath AlternatingGroup AlternatingGroupIndex AlternatingPaths AnimateGraph AntiSymmetricQ ApproximateVertexCover ArticulationVertices Automorphisms Backtrack BellmanFord BiconnectedComponents BiconnectedQ BinarySearch BinarySubsets BipartiteMatching BipartiteMatchingAndCover BipartiteQ BooleanAlgebra BreadthFirstTraversal Brelaz BrelazColoring Bridges ButterflyGraph CageGraph CartesianProduct Center ChangeEdges ChangeVertices ChromaticNumber ChromaticPolynomial ChvatalGraph Circle CirculantGraph CircularEmbedding CliqueQ CoarserSetPartitionQ CodeToLabeledTree Cofactor CompleteBinaryTree CompleteGraph CompleteKaryTree CompleteKPartiteGraph CompleteQ Compositions ConnectedComponents ConnectedQ ConstructTableau Contract CostOfPath CoxeterGraph CubeConnectedCycle CubicalGraph Cycle CycleIndex Cycles CycleStructure Cyclic CyclicGroup CyclicGroupIndex DeBruijnGraph DeBruijnSequence Degrees DegreeSequence DegreesOf2Neighborhood DeleteCycle DeleteEdge DeleteEdges DeleteFromTableau DeleteVertex DeleteVertices DepthFirstTraversal DerangementQ Derangements Diameter Dihedral DihedralGroup DihedralGroupIndex Dijkstra DilateVertices Directed Disk Distances DistinctPermutations Distribution DodecahedralGraph DominatingIntegerPartitionQ DominationLattice DurfeeSquare Eccentricity EdgeChromaticNumber EdgeColor EdgeColoring EdgeConnectivity EdgeDirection EdgeLabel EdgeLabelColor EdgeLabelPosition Edges EdgeStyle EdgeWeight Element EmptyGraph EmptyQ EncroachingListSet EquivalenceClasses EquivalenceRelationQ Equivalences Euclidean Eulerian EulerianCycle EulerianQ ExactRandomGraph ExpandGraph ExtractCycles FerrersDiagram FindCycle FindSet FiniteGraphs FirstLexicographicTableau FolkmanGraph FranklinGraph FromAdjacencyLists FromAdjacencyMatrix FromCycles FromInversionVector FromOrderedPairs FromUnorderedPairs FruchtGraph FunctionalGraph GeneralizedPetersenGraph GetEdgeLabels GetEdgeWeights GetVertexLabels GetVertexWeights Girth GraphCenter GraphComplement GraphDifference GraphicQ GraphIntersection GraphJoin GraphOptions GraphPolynomial GraphPower GraphProduct GraphSum GraphUnion GrayCodeKSubsets GrayCodeSubsets GrayGraph GreedyVertexCover GridGraph GroetzschGraph HamiltonianCycle HamiltonianQ Harary HasseDiagram Heapify HeapSort HeawoodGraph HerschelGraph HideCycles Highlight HighlightedEdgeColors HighlightedEdgeStyle HighlightedVertexColors HighlightedVertexStyle Hypercube IcosahedralGraph IdenticalQ IdentityPermutation IncidenceMatrix InDegree IndependentSetQ Index InduceSubgraph InitializeUnionFind InsertIntoTableau IntervalGraph Invariants InversePermutation InversionPoset Inversions InvolutionQ Involutions IsomorphicQ Isomorphism IsomorphismQ Josephus KnightsTourGraph KSetPartitions KSubsetGroup KSubsetGroupIndex KSubsets LabeledTreeToCode Large LastLexicographicTableau LeviGraph LexicographicPermutations LexicographicSubsets LineGraph ListGraphs ListNecklaces LNorm LongestIncreasingSubsequence LoopPosition LowerLeft LowerRight M MakeDirected MakeGraph MakeSimple MakeUndirected MaximalMatching MaximumAntichain MaximumClique MaximumIndependentSet MaximumSpanningTree McGeeGraph MeredithGraph MinimumChainPartition MinimumChangePermutations MinimumSpanningTree MinimumVertexColoring MinimumVertexCover MultipleEdgesQ MultiplicationTable MycielskiGraph NecklacePolynomial Neighborhood NetworkFlow NextBinarySubset NextComposition NextGrayCodeSubset NextKSubset NextLexicographicSubset NextPartition NextPermutation NextSubset NextTableau NoMultipleEdges NonLineGraphs NoPerfectMatchingGraph Normal NormalDashed NormalizeVertices NoSelfLoops NthSubset NumberOf2Paths NumberOfCompositions NumberOfDerangements NumberOfDirectedGraphs NumberOfGraphs NumberOfInvolutions NumberOfKPaths NumberOfNecklaces NumberOfPartitions NumberOfPermutationsByCycles NumberOfPermutationsByInversions NumberOfPermutationsByType NumberOfSpanningTrees NumberOfTableaux OctahedralGraph OddGraph One Optimum OrbitInventory OrbitRepresentatives Orbits Ordered OrientGraph OutDegree PairGroup PairGroupIndex Parent ParentsToPaths PartialOrderQ PartitionLattice PartitionQ Path PerfectQ PermutationGraph PermutationGroupQ PermutationQ PermutationToTableaux PermutationType PermutationWithCycle Permute PermuteSubgraph PetersenGraph PlanarQ PlotRange PseudographQ RadialEmbedding Radius RandomComposition RandomGraph RandomHeap RandomInteger RandomKSetPartition RandomKSubset RandomPartition RandomPermutation RandomRGF RandomSetPartition RandomSubset RandomTableau RandomTree RandomVertices RankBinarySubset RankedEmbedding RankGraph RankGrayCodeSubset RankKSetPartition RankKSubset RankPermutation RankRGF RankSetPartition RankSubset RealizeDegreeSequence ReflexiveQ RegularGraph RegularQ RemoveMultipleEdges RemoveSelfLoops ResidualFlowGraph RevealCycles ReverseEdges RGFQ RGFs RGFToSetPartition RobertsonGraph RootedEmbedding RotateVertices Runs SamenessRelation SelectionSort SelfComplementaryQ SelfLoopsQ SetEdgeLabels SetEdgeWeights SetGraphOptions SetPartitionListViaRGF SetPartitionQ SetPartitions SetPartitionToRGF SetVertexLabels SetVertexWeights ShakeGraph ShortestPath ShortestPathSpanningTree ShowGraph ShowGraphArray ShowLabeledGraph ShuffleExchangeGraph SignaturePermutation SimpleQ Small SmallestCyclicGroupGraph Spectrum SpringEmbedding StableMarriage Star StirlingFirst StirlingSecond Strings Strong StronglyConnectedComponents Subsets SymmetricGroup SymmetricGroupIndex SymmetricQ TableauClasses TableauQ Tableaux TableauxToPermutation TetrahedralGraph Thick ThickDashed Thin ThinDashed ThomassenGraph ToAdjacencyLists ToAdjacencyMatrix ToCanonicalSetPartition ToCycles ToInversionVector ToOrderedPairs TopologicalSort ToUnorderedPairs TransitiveClosure TransitiveQ TransitiveReduction TranslateVertices TransposePartition TransposeTableau TravelingSalesman TravelingSalesmanBounds TreeIsomorphismQ TreeQ TreeToCertificate TriangleInequalityQ Turan TutteGraph TwoColoring Undirected UndirectedQ UnionSet Uniquely3ColorableGraph UnitransitiveGraph UnrankBinarySubset UnrankGrayCodeSubset UnrankKSetPartition UnrankKSubset UnrankPermutation UnrankRGF UnrankSetPartition UnrankSubset UnweightedQ UpperLeft UpperRight V VertexColor VertexColoring VertexConnectivity VertexConnectivityGraph VertexCover VertexCoverQ VertexLabel VertexLabelColor VertexLabelPosition VertexNumber VertexNumberColor VertexNumberPosition VertexStyle VertexWeight Vertices WaltherGraph Weak WeaklyConnectedComponents WeightingFunction WeightRange Wheel Zoom
Functions »

Combinatorica

Combinatorica extends Mathematica by over 450 functions in combinatorics and graph theory. It includes functions for constructing graphs and other combinatorial objects, computing invariants of these objects, and finally displaying them. This documentation covers only a subset of these functions. The best guide to this package is the book Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, by Steven Skiena and Sriram Pemmaraju, published by Cambridge University Press, 2003. The new Combinatorica is a substantial rewrite of the original 1990 version. It is now much faster than before, and provides improved graphics and significant additional functionality.
You are encouraged to visit the website, www.combinatorica.com, where you will find the latest release of the package, an editor for Combinatorica graphs, and additional files of interest.
This loads the package.
In[1]:=
Click for copyable input

Permutations and Combinations

Permutations and subsets are the most basic combinatorial objects. Combinatorica provides functions for constructing objects both randomly and deterministically, to rank and unrank them, and to compute invariants on them. Here are examples of some of these functions in action.
These permutations are generated in minimum change order, where successive permutations differ by exactly one transposition. The built-in generator Permutations constructs permutations in lexicographic order.
In[2]:=
Click for copyable input
Out[2]=
The ranking function illustrates that the built-in function Permutations uses lexicographic sequencing.
In[3]:=
Click for copyable input
Out[3]=
With 3!=6 distinct permutations of three elements, within 20 random permutations you are likely to see all of them. Observe that it is unlikely for the first six permutations to all be distinct.
In[4]:=
Click for copyable input
Out[4]=
A fixed point of a permutation p is an element in the same position in p as in the inverse of p. Thus, the only fixed point in this permutation is 7.
In[5]:=
Click for copyable input
Out[5]=
The identity permutation consists of n singleton cycles or fixed points.
In[6]:=
Click for copyable input
Out[6]=
The classic problem in Polya theory is counting how many different ways necklaces can be made out of k beads, when there are m different types or colors of beads to choose from. When two necklaces are considered the same if they can be obtained only by shifting the beads (as opposed to turning the necklace over), the symmetries are defined by k permutations, each of which is a cyclic shift of the identity permutation. When a variable is specified for the number of colors, a polynomial results.
In[7]:=
Click for copyable input
Out[7]=
The number of inversions in a permutation is equal to that of its inverse.
In[8]:=
Click for copyable input
Out[8]=
Generating subsets incrementally is efficient when the goal is to find the first subset with a given property, since every subset need not be constructed.
In[9]:=
Click for copyable input
Out[9]=
In a Gray code, each subset differs in exactly one element from its neighbors. Observe that the last eight subsets all contain 1, while none of the first eight do.
In[10]:=
Click for copyable input
Out[10]=
A k-subset is a subset with exactly k elements in it. Since the lead element is placed in first, the k-subsets are given in lexicographic order.
In[11]:=
Click for copyable input
Out[11]=

Combinatorica functions for permutations.

Combinatorica functions for subsets.

Combinatorica functions for group theory.

Partitions, Compositions, and Young Tableaux

A partition of a positive integer n is a set of k strictly positive integers whose sum is n. A composition of n is a particular arrangement of nonnegative integers whose sum is n. A set partition of n elements is a grouping of all the elements into nonempty, nonintersecting subsets. A Young tableau is a structure of integers 1, ..., n where the number of elements in each row is defined by an integer partition of n. Further, the elements of each row and column are in increasing order, and the rows are left justified. These four related combinatorial objects have a host of interesting applications and properties.
Here are the eleven partitions of 6. Observe that they are given in reverse lexicographic order.
In[12]:=
Click for copyable input
Out[12]=
Although the number of partitions grows exponentially, it does so more slowly than permutations or subsets, so complete tables can be generated for larger values of n.
In[13]:=
Click for copyable input
Out[13]=
Ferrers diagrams represent partitions as patterns of dots. They provide a useful tool for visualizing partitions, because moving the dots around provides a mechanism for proving bijections between classes of partitions. This constructs a random partition of 100.
In[14]:=
Click for copyable input
Out[14]=
Here every composition of 5 into 3 parts is generated exactly once.
In[15]:=
Click for copyable input
Out[15]=
Set partitions are different than integer partitions, representing the ways you can partition distinct elements into subsets. They are useful for representing colorings and clusterings.
In[16]:=
Click for copyable input
Out[16]=
The list of tableaux of shape {2, 2, 1} illustrates the amount of freedom available to tableaux structures. The smallest element is always in the upper left-hand corner, but the largest element is free to be the rightmost position of the last row defined by the distinct parts of the partition.
In[17]:=
Click for copyable input
Out[17]=
By iterating through the different integer partitions as shapes, all tableaux of a particular size can be constructed.
In[18]:=
Click for copyable input
Out[18]=
The hook length formula can be used to count the number of tableaux for any shape. Using the hook length formula over all partitions of n computes the number of tableaux on n elements.
In[19]:=
Click for copyable input
Out[19]=
Each of the 117,123,756,750 tableaux of this shape will be selected with equal likelihood.
In[20]:=
Click for copyable input
Out[20]//TableForm=
A pigeonhole result states that any sequence of n2+1 distinct integers must contain either an increasing or a decreasing scattered subsequence of length n+1.
In[21]:=
Click for copyable input
Out[21]=

Combinatorica functions for integer partitions.

Combinatorica functions for set partitions.

Combinatorica functions for Young tableaux.

Combinatorica functions for counting.

Representing Graphs

A graph is defined as a set of vertices with a set of edges, where an edge is defined as a pair of vertices. The representation of graphs takes on different requirements depending upon whether the intended consumer is a person or a machine. Computers digest graphs best as data structures such as adjacency matrices or lists. People prefer a visualization of the structure as a collection of points connected by lines, which implies adding geometric information to the graph.
In the complete graph on five vertices, denoted K5, each vertex is adjacent to all other vertices. CompleteGraph[n] constructs the complete graph on n vertices.
In[22]:=
Click for copyable input
Out[22]=
The internals of the graph representation are not shown to the user—only a notation with the number of edges and vertices, followed by whether the graph is directed or undirected.
In[23]:=
Click for copyable input
Out[23]=
The adjacency matrix of K5 shows that each vertex is adjacent to all other vertices. The main diagonal consists of zeros, since there are no self-loops in the complete graph, meaning edges from a vertex to itself.
In[24]:=
Click for copyable input
Out[24]//TableForm=
The standard embedding of K5 consists of five vertices equally spaced on a circle.
In[25]:=
Click for copyable input
Out[25]=
The number of vertices in a graph is termed the order of the graph.
In[26]:=
Click for copyable input
Out[26]=
M returns the number of edges in a graph.
In[27]:=
Click for copyable input
Out[27]=
Edge/vertex colors/styles can be globally modified, giving complete flexibility to change the appearance of a graph.
In[28]:=
Click for copyable input
Out[28]=
The colors, styles, labels, and weights of individual vertices and edges can also be changed individually, perhaps to highlight interesting features of the graph.
In[29]:=
Click for copyable input
Out[29]=
A star is a tree with one vertex of degree n-1. Adding any new edge to a star produces a cycle of length 3.
In[30]:=
Click for copyable input
Out[30]=
Graphs with multi-edges and self-loops are supported. Here there are two copies of each edge of a star.
In[31]:=
Click for copyable input
Out[31]=
The adjacency list representation of a graph consists of n lists, one list for each vertex vi, 1≤in, which records the vertices to which vi is adjacent. Each vertex in the complete graph is adjacent to all other vertices.
In[32]:=
Click for copyable input
Out[32]//TableForm=
There are n (n-1) ordered pairs of edges defined by a complete graph of order n.
In[33]:=
Click for copyable input
Out[33]=
An induced subgraph of a graph G is a subset of the vertices of G together with any edges whose endpoints are both in this subset. An induced subgraph that is complete is called a clique. Any subset of the vertices in a complete graph defines a clique.
In[34]:=
Click for copyable input
Out[34]=
The vertices of a bipartite graph have the property that they can be partitioned into two sets such that no edge connects two vertices of the same set. Contracting an edge in a bipartite graph can ruin its bipartiteness. Note the self-loop created by the contraction.
In[35]:=
Click for copyable input
Out[35]=
A breadth-first search of a graph explores all the vertices adjacent to the current vertex before moving on. A breadth-first traversal of a simple cycle alternates sides as it wraps around the cycle.
In[36]:=
Click for copyable input
Out[36]=
In a depth-first search, the children of the first son of a vertex are explored before visiting his brothers. The depth-first traversal differs from the breadth-first traversal above in that it proceeds directly around the cycle.
In[37]:=
Click for copyable input
Out[37]=
Different drawings or embeddings of a graph can reveal different aspects of its structure. The default embedding for a grid graph is a ranked embedding from all the vertices on one side. Ranking from the center vertex yields a different but interesting drawing.
In[38]:=
Click for copyable input
Out[38]=
The radial embedding of a tree is guaranteed to be planar, but radial embeddings can be used with any graph. Here is a radial embedding of a random labeled tree.
In[39]:=
Click for copyable input
Out[39]=
By arbitrarily selecting a root, any tree can be represented as a rooted tree.
In[40]:=
Click for copyable input
Out[40]=
An interesting general heuristic for drawing graphs models the graph as a system of springs and lets Hooke's law space the vertices. Here it does a good job illustrating the join operation, where each vertex of K7 is connected to each of two disconnected vertices. In achieving the minimum energy configuration, these two vertices end up on different sides of K7.
In[41]:=
Click for copyable input
Out[41]=

Combinatorica functions for modifying graphs.

Combinatorica functions for graph format translation.

Combinatorica options for graph functions.

Combinatorica functions for graph labels and weights.

Combinatorica functions for drawing graphs.

Generating Graphs

Many graphs consistently prove interesting, in the sense that they are models of important binary relations or have unique graph theoretic properties. Often these graphs can be parameterized, such as the complete graph on n vertices Kn, giving a concise notation for expressing an infinite class of graphs. Start off with several operations that act on graphs to give different graphs and which, together with parameterized graphs, give the means to construct essentially any interesting graph.
The union of two connected graphs has two connected components.
In[42]:=
Click for copyable input
Out[42]=
Graph products can be very interesting. The embedding of a product has been designed to show off its structure, and is formed by shrinking the first graph and translating it to the position of each vertex in the second graph.
In[43]:=
Click for copyable input
Out[43]=
The line graph L (G) of a graph G has a vertex of L (G) associated with each edge of G, and an edge of L (G) if and only if the two edges of G share a common vertex.
In[44]:=
Click for copyable input
Out[44]=
Circulants are graphs whose adjacency matrix can be constructed by rotating a vector n times, and include complete graphs and cycles as special cases. Even random circulant graphs have an interesting, regular structure.
In[45]:=
Click for copyable input
Out[45]=
Some graph generators create directed graphs with self-loops, such as this de Bruijn or shift register graph encoding all length-5 substrings of a binary alphabet.
In[46]:=
Click for copyable input
Out[46]=
Hypercubes of dimension d are the graph product of cubes of dimension d-1 and the complete graph K2. Here, a Hamiltonian cycle of the hypercube is highlighted. Colored highlighting and graph animations are also provided in the package.
In[47]:=
Click for copyable input
Out[47]=
Several of the built-in graph construction functions do not have parameters and only construct a single interesting graph. FiniteGraphs collects them together in one list for convenient reference. ShowGraphArray permits the display of multiple graphs in one window.
In[48]:=
Click for copyable input
Out[48]=

Combinatorica functions for graph constructors.

Properties of Graphs

Graph theory is the study of properties or invariants of graphs. Among the properties of interest are such things as connectivity, cycle structure, and chromatic number. Here is a demonstration of how to compute several different graph invariants.
An undirected graph is connected if a path exists between any pair of vertices. Deleting an edge from a connected graph can disconnect it. Such an edge is called a bridge.
In[49]:=
Click for copyable input
Out[49]=
GraphUnion can be used to create disconnected graphs.
In[50]:=
Click for copyable input
Out[50]=
An orientation of an undirected graph G is an assignment of exactly one direction to each of the edges of G. Note that arrows denoting the direction of each edge are automatically drawn in displaying directed graphs.
In[51]:=
Click for copyable input
Out[51]=
An articulation vertex of a graph G is a vertex whose deletion disconnects G. Any graph with no articulation vertices is said to be biconnected. A graph with a vertex of degree 1 cannot be biconnected, since deleting the other vertex that defines its only edge disconnects the graph.
In[52]:=
Click for copyable input
Out[52]=
The only articulation vertex of a star is its center, even though its deletion leaves n-1 connected components. Deleting a leaf leaves a connected tree.
In[53]:=
Click for copyable input
Out[53]=
Every edge in a tree is a bridge.
In[54]:=
Click for copyable input
Out[54]=
A graph is said to be k-connected if there does not exist a set of k-1 vertices whose removal disconnects the graph. The wheel is the basic triconnected graph.
In[55]:=
Click for copyable input
Out[55]=
A graph is k-edge-connected if there does not exist a set of k-1 edges whose removal disconnects the graph. The edge connectivity of a graph is at most the minimum degree , since deleting those edges disconnects the graph. Complete bipartite graphs realize this bound.
In[56]:=
Click for copyable input
Out[56]=
These two complete bipartite graphs are isomorphic, since the order of the two stages is simply reversed. Here, all isomorphisms are returned.
In[57]:=
Click for copyable input
Out[57]=
A graph is self-complementary if it is isomorphic to its complement. The smallest nontrivial self-complementary graphs are the path on four vertices and the cycle on five.
In[58]:=
Click for copyable input
Out[58]=
A directed graph in which half the possible edges exist is almost certain to contain a cycle. Directed acyclic graphs are often called DAGs.
In[59]:=
Click for copyable input
Out[59]=
The girth of a graph is the length of its shortest cycle. A cage is the smallest possible regular graph (here degree 3) that has a prescribed girth.
In[60]:=
Click for copyable input
Out[60]=
An Eulerian cycle is a complete tour of all the edges of a graph. An Eulerian cycle of a bipartite graph bounces back and forth between the stages.
In[61]:=
Click for copyable input
Out[61]=

Combinatorica functions for graph predicates.

A Hamiltonian cycle of a graph G is a cycle that visits every vertex in G exactly once, as opposed to an Eulerian cycle that visits each edge exactly once. Kn, n for n>1 are the only Hamiltonian complete bipartite graphs.
In[62]:=
Click for copyable input
Out[62]=
The divisibility relation between integers is reflexive, since each integer divides itself, and anti-symmetric, since x cannot divide y if x>y. Finally, it is transitive, as x\y implies y=c x for some integer c, so y\z implies x\z.
In[63]:=
Click for copyable input
Out[63]=
Since the divisibility relation is reflexive, transitive, and anti-symmetric, it is a partial order.
In[64]:=
Click for copyable input
Out[64]=
A graph G is transitive if any three vertices x, y, z, such that edges {x, y} , {y, z}G, imply {x, z}G. The transitive reduction of a graph G is the smallest graph R (G) such that C (G)=C (R (G)). The transitive reduction eliminates all implied edges in the divisibility relation, such as 4\8, 1\4, 1\6, and 1\8.
In[65]:=
Click for copyable input
Out[65]=
The Hasse diagram clearly shows the lattice structure of the Boolean algebra, the partial order defined by inclusion on the set of subsets.
In[66]:=
Click for copyable input
Out[66]=
A topological sort is a permutation p of the vertices of a graph such that an edge {i, j} implies i appears before j in p. A complete directed acyclic graph defines a total order, so there is only one possible output from TopologicalSort.
In[67]:=
Click for copyable input
Out[67]=
Any labeled graph G can be colored in a certain number of ways with exactly k colors 1, ..., k. This number is determined by the chromatic polynomial of the graph.
In[68]:=
Click for copyable input
Out[68]=

Combinatorica functions for graph invariants.

Algorithmic Graph Theory

Finally, there are several invariants of graphs that are of particular interest because of the algorithms that compute them.
The shortest-path spanning tree of a grid graph is defined in terms of Manhattan distance, where the distance between points with coordinates (x, y) and (u, v) is x-u+y-v.
In[69]:=
Click for copyable input
Out[69]=
In an unweighted graph, there can be many different shortest paths between any pair of vertices. This path between two opposing corners goes all the way to the right, then all the way to the top.
In[70]:=
Click for copyable input
Out[70]=
A minimum spanning tree of a weighted graph is a set of n-1 edges of minimum total weight that form a spanning tree of the graph. Any spanning tree is a minimum spanning tree when the graphs are unweighted.
In[71]:=
Click for copyable input
Out[71]=
The number of spanning trees of a complete graph is nn-2, as was proved by Cayley.
In[72]:=
Click for copyable input
Out[72]=
The maximum flow through an unweighted complete bipartite graph G is the minimum degree (G).
In[73]:=
Click for copyable input
Out[73]=
A matching, in a graph G, is a set of edges of G such that no two of them share a vertex in common. A perfect matching of an even cycle consists of alternating edges in the cycle.
In[74]:=
Click for copyable input
Out[74]=
Any maximal matching of a Kn is a maximum matching, and perfect if n is even.
In[75]:=
Click for copyable input
Out[75]=

Combinatorica functions for graph algorithms.