Steinitz's theorem

Known as: Steinitz theorem, Skeletal regular polyhedra, Skeletal regular polyhedron 
In polyhedral combinatorics, a branch of mathematics, Steinitz's theorem is a characterization of the undirected graphs formed by the edges and… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1980-2017
01219802017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2013
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
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)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
2004
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
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
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1990
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
Planar graphs are of great importance in graph theory. They are interesting in their own right and their chromatic, enumerative… (More)
  • figure 1
  • figure 3
Is this relevant?