I would like to enumerate All the 1-factors or perfect matchings, of the complete directed graph Kn (the number of vertexes is even ) if there is an algorithm or method to enumerate all the perfect matchings?
Asked
Active
Viewed 64 times
1
-
Welcome to Mathematica.SE. Are you sure you are posting on the right site? There is nothing in your question making it clear that it is concerned with Mathematica software. – m_goldberg Jul 07 '16 at 19:21
-
5Have you see this? – yode Jul 07 '16 at 19:30