Skip to search formSkip to main contentSkip to account menu

Eulerian matroid

In matroid theory, an Eulerian matroid is a matroid whose elements can be partitioned into a collection of disjoint circuits.
Wikipedia (opens in a new tab)

Related topics

Related topics

13 relations
Binary matroidDual graphDual matroidEulerian path

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Conditions for coverings to induce matroids
Coverings are a useful form of data structure, and covering-based rough sets provide an effective tool to cope with this type of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)