Hello,

As a part of my study in using Matroid Intersection program I need to feed in two matroid constraints:

1. Is graphic matroids that is a matroid set having all possible acyclic combinations of a graph.

2. Is a partition matroid which is based on edge coloring of the input graph.

I am looking for a piece of software which would generate graphic matroid set of acyclic edge combinations based on the input graph.

More Mihir Malladi's questions See All
Similar questions and discussions