| Chinese Abstract | 第1-15页 |
| English Abstract | 第15-26页 |
| Symbols | 第26-27页 |
| Chapter 1 Introduction | 第27-34页 |
| ·Basic Definitions and Notations | 第27-28页 |
| ·Introduction on Factors of Graphs | 第28-32页 |
| ·Introduction on Fractional Factors of Graphs | 第32-34页 |
| Chapter 2 (g, f)-Factors in Bipartite Graphs | 第34-49页 |
| ·(g, f)-Factors in Bipartite (mg, mf)-Graphs | 第34-43页 |
| ·Preliminary and Results | 第34-37页 |
| ·Proof of Main Theorems | 第37-43页 |
| ·On Toughness and (g, f)-Factors in Bipartite Graphs | 第43-49页 |
| ·Preliminary and Results | 第43-44页 |
| ·Proof of Main Theorems | 第44-49页 |
| Chapter 3 Factors in K_(1,n)-Free Graphs | 第49-64页 |
| ·(g, f)-Factors in K_(1,n)-Free Graphs | 第49-54页 |
| ·On (f; m)-Uniform Graphs | 第54-64页 |
| ·Preliminary and Results | 第54-56页 |
| ·The Lemmas | 第56-57页 |
| ·Proof of Main Theorems | 第57-64页 |
| Chapter 4 On (g, f)-Factors and Fractional (g, f)-Factors | 第64-76页 |
| ·Neighborhood Conditions and (g, f)-Factors | 第64-67页 |
| ·On Binding number for Graphs to have (g, f)-Factors | 第67-71页 |
| ·Fractional Factors and Connected Induced Subgraphs | 第71-76页 |
| Chapter 5 On Fractional Matching Extension | 第76-88页 |
| ·Fractional Defect-d Matching | 第76-80页 |
| ·Fractional (n, k, d)-Graphs | 第80-85页 |
| ·Fractional Matching Extension in K_(1,n)-Free Graphs | 第85-88页 |
| Chapter 6 On n- Factor-Critical Graphs | 第88-105页 |
| ·On Fractional n-Factor-Critical Graphs | 第88-90页 |
| ·Fractional n-Factor-Criticality and Complete Closure | 第90-95页 |
| ·On Toughness and (a, b; n)-Critical Graphs | 第95-100页 |
| ·Fractional (a, b; n)-Critical Graphs and Isolated Toughness | 第100-105页 |
| References | 第105-112页 |
| Acknowledgement | 第112-113页 |
| Curriculum Vitae | 第113-115页 |
| 学位论文评阅及答辩情况表 | 第115页 |
