On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs
On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs
复制标题
DOI：
10.1007/bfb0060102
复制
发表时间：
1969
期刊：
影响因子：
--
通讯作者：
D. Barnette
中科院分区：
文献类型：
--
作者：
D. Barnette
1.导论.每一个3-多面体（即3维凸多面体）P的顶点和边决定了一个图G（p），P的。证明G（p）是平面的并且对于每一个3-多面体P是3-连通的是非常容易的。匡威命题构成了已知结果的非平凡部分，
1. Introduction. The vertices and edges of every 3-polytope (ie, 3-dimensional convex polytope) P determine a graph G (p), the of P. It is very easy to prove that G (p) is planar and 3-connected for each 3-polytope P. The converse statement constitutes the nontrivial part of the result known as