|
|||||
|
|
| EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(Ⅰ) | |
| 作者姓名： | FAN Hongbing |
| 作者单位： | FAN Hongbing Department of Mathematics，Shandong University，Jinan 250100，China |
| 基金项目： | This research is supported by the National Natural Science Foundation of China. |
| 摘 要： | 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. |
| 本文献已被 CNKI 等数据库收录！ | |