Pages that link to "Item:Q1349279"
From MaRDI portal
The following pages link to Generation of oriented matroids --- a graph theoretical approach (Q1349279):
Displaying 20 items.
- Enumeration of PLCP-orientations of the 4-cube (Q491752) (← links)
- On the number of simple arrangements of five double pseudolines (Q629847) (← links)
- Matroid enumeration for incidence geometry (Q664549) (← links)
- Nonrealizable minimal vertex triangulations of surfaces: showing nonrealizability using oriented matroids and satisfiability solvers (Q848679) (← links)
- Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
- How many circuits determine an oriented matroid? (Q1786051) (← links)
- A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
- Complete enumeration of small realizable oriented matroids (Q1943649) (← links)
- Many order types on integer grids of polynomial size (Q2096371) (← links)
- Diameters of cocircuit graphs of oriented matroids: an update (Q2121728) (← links)
- A characterization of cocircuit graphs of uniform oriented matroids (Q2496197) (← links)
- A graph-theoretical axiomatization of oriented matroids (Q2509765) (← links)
- Polynomial time recognition of uniform cocircuit graphs (Q2840512) (← links)
- (Q4005662) (← links)
- Codimension Two and Three Kneser Transversals (Q4568090) (← links)
- Recent developments in spatial graph theory (Q4635094) (← links)
- Computing the orientable genus of projective graphs (Q4857427) (← links)
- The Pizza-Cutter’s Problem and Hamiltonian Paths (Q5108605) (← links)
- (Q6179339) (← links)
- On \(k\)-neighborly reorientations of oriented matroids (Q6201920) (← links)
