This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We present an algorithm which takes a graph as input and decides in cubic time if the graph is the cocircuit graph of a uniform oriented matroid. In the affirmative case the algor...
We discuss methods for the generation of oriented matroids and of isomorphism classes of oriented matroids. Our methods are based on single element extensions and graph theoretica...