|
|||||
|
|
| EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(IV) | |
| 引用本文： | FAN Hongbing (Department of Mathematics,Shandong University,Ji''''nan 250100,China). EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(IV)[J]. 系统科学与复杂性, 1994, 0(3) |
| 作者姓名： | FAN Hongbing (Department of Mathematics Shandong University Ji''''nan 250100 China) |
| 作者单位： | Department of Mathematics，Shandong University，Ji'nan 250100，China |
| 摘 要： | ＥＤＧＥＲＥＣＯＮＳＴＲＵＣＴＩＯＮＯＦＰＬＡＮＡＲＧＲＡＰＨＳＷＩＴＨＭＩＮＩＭＵＭＤＥＧＲＥＥＡＴＬＥＡＳＴＴＨＲＥＥ－（ＩＶ）￥ＦＡＮＨｏｎｇｂｉｎｇ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｎｄｏｎｇＵｎｉｖｅｒｓｉｔｙ，Ｊｉ＇... |
EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(IV) |
|
| FAN Hongbing. EDGE RECONSTRUCTION OF PLANAR GRAPHS WITH MINIMUM DEGREE AT LEAST THREE-(IV)[J]. Journal of Systems Science and Complexity, 1994, 0(3) | |
| Authors: | FAN Hongbing |
| Abstract: | The object of this series of papers is to show that every planar graph of minimum degree at least 3 is edge reconstructible. In this paper we show that each 3-connected planar graph of minimum degree 3 and with at least one of its 3-vertex deleted subgraphs being not 3-connected, is edge reconstructible. This is the last theorem concerning the assertion that planar graphs with minimum degree at least 3 are edge reconstructible. |
| Keywords: | Reconstruction planar graph embedding. |
| 本文献已被 CNKI 等数据库收录！ | |