✦ LIBER ✦

Inseparability graphs of oriented matroids

✍ Scribed by J. -P. Roudneff

Publisher: Springer-Verlag
Year: 1989
Tongue: English
Weight: 533 KB
Volume: 9
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02122686

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Antipodal graphs and oriented matroids

✍ Komei Fukuda; Keiichi Handa 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 786 KB

A graph is antipodal if, for every vertex c', there exists exactly one vertex V which is not closer to r than every vertex adjacent to 6. In this paper we consider the problem of characterizing tope graphs of oriented matroids, which constitute a broad class of antipodal graphs. One of the results i

Visibility Graphs and Oriented Matroids

✍ Abello; Kumar 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 133 KB

Spatial Graphs and Oriented Matroids: th

Spatial Graphs and Oriented Matroids: the Trefoil

✍ J. L. Ramirez Alfonsin 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 165 KB

On sign-invariance graphs of uniform ori

On sign-invariance graphs of uniform oriented matroids

✍ Raul Cordovil; Pierre Duchet 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Cocircuit Graphs and Efficient Orientati

Cocircuit Graphs and Efficient Orientation Reconstruction in Oriented Matroids

✍ Eric Babson; Lukas Finschi; Komei Fukuda 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 294 KB

We consider the cocircuit graph G M of an oriented matroid M, which is the 1-skeleton of the cell complex formed by the span of the cocircuits of M. As a result of Cordovil, Fukuda, and Guedes de Oliveira, the isomorphism class of M is not determined by G M , but it is determined if M is uniform and

Generation of Oriented Matroids—A Graph

Generation of Oriented Matroids—A Graph Theoretical Approach

✍ L. Finschi; K. Fukuda 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 234 KB