Didn't get you. Can you explain a bit more?
On Tuesday, June 9, 2015 at 12:47:51 PM UTC-5, Nathann Cohen wrote:
>
> Say I have a K_{n,n} and from it I want to extract d mutually disjoint
>> perfect matchings.
>>
>> How can this be done?
>>
>
>
> http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/graph_coloring.html#sage.graphs.graph_coloring.edge_coloring
>
>
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-support.
For more options, visit https://groups.google.com/d/optout.
