๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Visibility Graphs and Oriented Matroids

โœ Scribed by Abello; Kumar

Publisher
Springer
Year
2002
Tongue
English
Weight
133 KB
Volume
28
Category
Article
ISSN
0179-5376

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Antipodal graphs and oriented matroids
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

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