The number of polyhedral (3-connected planar) graphs

被引：0
|
作者：
Duijvestijn, AJW
机构：
[1] Department of Informatics, Technological University Twente, Enschede
来源：
MATHEMATICS OF COMPUTATION | 1996年 / 65卷 / 215期
关键词：
graph theory; S-connected graphs; polyhedral graphs;
D O I：
10.1090/S0025-5718-96-00749-1
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Data is presented on the number of 3-connected planar graphs, isomorphic to the graphs of convex polyhedra, with up to 26 edges. Results have been checked with the the number of rooted c-nets of R.C. Mullin and P.J. Schellenberg and Liu Yanpei.
引用
收藏
页码：1289 / 1293
页数：5
相关论文
共 50 条
12345