Keiichi Handa

Learn More
Fukuda, K. and K. Handa, Antipodal graphs and oriented matroids, Discrete Mathematics 111 (1993) 2455256. 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(More)
  • 1