In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- David Eppstein, Elena Mumford
- JoCG
- 2014

We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three… (More)

Is this relevant?

2013

2013

- Igor Pak, Stedman Wilson
- ArXiv
- 2013

We give a new proof of Steinitz’s classical theorem in the case of plane triangulations, which allows us to obtain a new general… (More)

Is this relevant?

2010

2010

- David Eppstein, Elena Mumford
- Symposium on Computational Geometry
- 2010

We define a <i>simple orthogonal polyhedron</i> to be a three-dimensional polyhedron with the topology of a sphere in which three… (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Igor Pak
- 2008

1. The Helly theorem 11 2. Carathéodory and Bárány theorems 20 3. The Borsuk conjecture 26 4. Fair division 32 5. Inscribed and… (More)

Is this relevant?

2004

2004

- Jing-Chao Chen
- 2004

For simplicity, we follow the rules: V denotes a real linear space, W denotes a subspace of V , x denotes a set, n denotes a… (More)

Is this relevant?

Review

1995

Review

1995

- Mariusz Zynel
- 1995

The main purpose of the paper is to define the dimension of an abstract vector space. The dimension of a finite-dimensional… (More)

Is this relevant?

Highly Cited

1990

Highly Cited

1990

- David G. Kirkpatrick, Bud Mishra, Chee-Keng Yap
- STOC
- 1990

We prove the following quantitative form of a classical theorem of Steinitz: Let m be sufficiently large. I f the convex huh of a… (More)

Is this relevant?

1990

1990

- Wojciech Banaszczyk
- Eur. J. Comb.
- 1990

The inequality in (a) is naturally the best possible. Theorem l(a) is connected with questions such as the Beck-Fiala theorem or… (More)

Is this relevant?

1989

1989

We prove the following quantitative form of a classical theorem of Steinitz: Let m be suuciently large. If the convex hull of a… (More)

Is this relevant?

1981

1981

- Carsten Thomassen
- Journal of Graph Theory
- 1981

Planar graphs are of great importance in graph theory. They are interesting in their own right and their chromatic, enumerative… (More)

Is this relevant?