Cocircuit Graphs and Efficient Orientation Reconstruction in Oriented Matroids

European Journal of Combinatorics

Volumn 22, Issue 5, 2001, Pages 587-600

  Babson, Eric ^a   Finschi, Lukas ^b   Fukuda, Komei ^c  

^a UNIVERSITY OF WASHINGTON   (United States)

^b ETH ZURICH   (Switzerland)

^c EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035634193     PISSN: 01956698     EISSN: None     Source Type: Journal    
DOI: 10.1006/eujc.2001.0481     Document Type: Article

References (12)

1. A. Björner, M. Las Vergnas, B. Sturmfels, N. White and G. Ziegler, Oriented Matroids, Cambridge University Press, 2nd edn., ISBN 0-521-41836-4, 1999.
2. R. Blind and P. Mani-Levitska, Puzzles and polytope isomorphisms, Aequationes Mathematicae, 34 (1987), 287-297.
3. R. Cordovil and K. Fukuda, Oriented matroids and combinatorial manifolds, Europ. J. Combinatorics, 14 (1993), 9-15.
4. R. Cordovil, K. Fukuda and A. Guedes de Oliveira, On the cocircuit-graph of an oriented matroid, Discrete and Comput. Geom., 24 (2000), 257-265.
5. J. Folkman and J. Lawrence, Oriented matroids, J. Comb. Theory, Ser. B, 25 (1978), 199-236.
6. K. Fukuda and K. Handa, Antipodal graphs and oriented matroids, Discrete Math., 111 (1993), 245-256.
7. W. Hochstättler, A lattice-theoretical characterization of oriented matroids, Europ. J. Combinatorics, 18 (1997), 563-574.
8. M. Joswig, Reconstructing a non-simple polytope from its graph, in: Polytopes - Combinatorics and Computation, DMV-Seminar, 29, Birkhäuser, 2000, pp. 167-176.
9. G. Kalai, A simple way to tell a simple polytope from its graph, J. Comb. Theory, Ser. A, 49 (1988), 381-383.
10. N. E. Mnëv, The universality theorems on the classification problem of configuration varieties and convex polytopes varieties, in: Lecture Notes in Mathematics, 1346, Springer, 1988, pp. 527-543.
11. J.-P. Roudneff, Reconstruction of the orientation class of an oriented matroid, Europ. J. Combinatorics, 9 (1988), 423-429.
12. P. W Shor, Stretchablity of pseudolines is NP-hard, in: Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 4, ISBN 0-8218-6593-5, 1991, pp. 531-554.