4.3 Article

Graphs of polyhedra;: polyhedra as graphs

期刊

DISCRETE MATHEMATICS
卷 307, 期 3-5, 页码 445-463

出版社

ELSEVIER
DOI: 10.1016/j.disc.2005.09.037

关键词

polygon; 3-connected planar graph; Steinitz's theorem; convex polyhedron; nonconvex polyhedron; abstract polyhedron

向作者/读者索取更多资源

Relations between graph theory and polyhedra are presented in two contexts. In the first, the symbiotic dependence between 3-connected planar graphs and convex polyhedra is described in detail. In the second, a theory of nonconvex polyhedra is based on a graph-theoretic foundation. This approach eliminates the vagueness and inconsistency that pervade much of the literature dealing with polyhedra more general than the convex ones. (c) 2006 Elsevier B.V. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.3
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据