| 英文摘要 | 第1-52页 |
| 1 The construction and the recognition of planar 1-cycle resonant graphs | 第52-65页 |
| 1．1 Introduction | 第53-56页 |
| 1．2 A construction method of planar 1-cycle resonant graphs | 第56-62页 |
| 1．3 The algorithm for determining if a given plane graph is 1-cycle resonant | 第62-65页 |
| 2 Hamiltonicity of 4-connected graphs | 第65-93页 |
| 2．1 Introduction and notation | 第66-69页 |
| 2．2 Preliminary lemmas | 第69-78页 |
| 2．3 The independence of some types of vertices | 第78-90页 |
| 2．4 Proof of Theorem A | 第90-93页 |
| 3 Some results about dissections of trees | 第93-105页 |
| 3．1 Introduction and the notation of the dissections of graphs | 第94-97页 |
| 3．2 The dissections of some classes of trees | 第97-101页 |
| 3．3 The upper and lower bounds of the dissections of trees | 第101-105页 |
| Bibliography | 第105-108页 |
