| Abstract | 第6-8页 |
| 摘要 | 第9-12页 |
| Chapter 1 Preliminary | 第12-21页 |
| 1.1 Some basic definitions and notations | 第12-14页 |
| 1.2 Edge coloring and vertex coloring | 第14-17页 |
| 1.3 Judicious partition of graphs | 第17-19页 |
| 1.4 Balanced partition of graphs | 第19-21页 |
| Chapter 2 Edge coloring of 1-planar graphs | 第21-32页 |
| 2.1 Introduction | 第21-22页 |
| 2.2 Basic definitions and lemmas | 第22-26页 |
| 2.3 Proof of Theorem 2.1.1 | 第26-32页 |
| Chapter 3 3-choosability of plane graphs | 第32-38页 |
| 3.1 Introduction | 第32-33页 |
| 3.2 Plane graphs without cycles of length from 4 to 6 | 第33-35页 |
| 3.3 Plane graphs without cycles of length from 4 to 5 | 第35-38页 |
| Chapter 4 Injective coloring of planar cubic graphs | 第38-52页 |
| 4.1 Introduction | 第38-40页 |
| 4.2 Connectivity of minimum counterexamples | 第40-52页 |
| Chapter 5 Judicious partition of graphs and r-uniform hypergraphs | 第52-67页 |
| 5.1 Introduction | 第52-55页 |
| 5.2 Judicious partition of r-uniform hypergraphs | 第55-62页 |
| 5.3 Judicious partition of graphs | 第62-67页 |
| Chapter 6 Balanced parititions of graphs | 第67-80页 |
| 6.1 Introduction | 第67-69页 |
| 6.2 Max bisections of graphs | 第69-72页 |
| 6.3 Finding a maximum matching with some properties | 第72-77页 |
| 6.4 Judicious balanced k-partition of graphs | 第77-80页 |
| Bibliography | 第80-87页 |
| Papers published and completed in the period of Ph. D. Education | 第87-88页 |
| Acknowledgements | 第88页 |
