NoPerfectMatchingGraph

As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. >>

NoPerfectMatchingGraph

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

Details

Examples

Basic Examples  (2)

In[1]:=
Click for copyable input
In[2]:=
Click for copyable input
In[3]:=
Click for copyable input
Out[3]=

NoPerfectMatchingGraph has been superseded by GraphData:

In[1]:=
Click for copyable input
Out[1]=

See Also

GraphData  BipartiteMatching  FiniteGraphs

Tutorials