Cocircuit graphs and efficient orientation reconstruction in oriented matroids

DOI10.1006/eujc.2001.0481zbMath0988.52032OpenAlexW2160442375MaRDI QIDQ5944000

Lukas Finschi, Eric K. Babson, Komei Fukuda

Publication date: 19 February 2002

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://infoscience.epfl.ch/record/77402/files/Babson2001_17.pdf

zbMATH Keywords

oriented matroidalgorithms in polynomial timecocircuit graphsefficient orientation

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial aspects of matroids and geometric lattices (05B35) Oriented matroids in discrete geometry (52C40)

Related Items

Diameters of cocircuit graphs of oriented matroids: an update ⋮ Reconstructibility of Matroid Polytopes ⋮ Enumerating Neighborly Polytopes and Oriented Matroids ⋮ Cubic time recognition of cocircuit graphs of uniform oriented matroids ⋮ Purity and Separation for Oriented Matroids ⋮ Corners and simpliciality in oriented matroids and partial cubes ⋮ Unnamed Item ⋮ A characterization of cocircuit graphs of uniform oriented matroids ⋮ Graphs, skeleta and reconstruction of polytopes ⋮ A graph-theoretical axiomatization of oriented matroids ⋮ Sign conditions for injectivity of generalized polynomial maps with applications to chemical reaction networks and real algebraic geometry ⋮ Graph encoding of 2D-gon tilings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstruction of the orientation class of an oriented matroid
• Antipodal graphs and oriented matroids
• Puzzles and polytope isomorphisms
• A simple way to tell a simple polytope from its graph
• Oriented matroids and combinatorial manifolds
• Oriented matroids
• A lattice-theoretical characterization of oriented matroids
• On the cocircuit graph of an oriented matroid
• Oriented Matroids