未找到相关数据
EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(Ⅰ)
被引：0
作者：
FAN Hongbing Department of Mathematics Shandong University Jinan China
[250100
]
机构：
关键词：
Reconstruction;
isomorphism;
planar graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
<正> The object of this series of papers is to show that every planar graph ofminimum degree at least 3 is edge reconstructible. In this paper, we prove that such agraph with connectivity 2 is edge reconstructible.
引用
收藏
页码：376 / 382
页数：7
相关论文