v1.0(June, 2007). First version on the web.

Contents

1. 1. Matchings and 1-Factors
1. 1.1 Matchings in Bipartite Graphs
2. 1.2 Covers and Transversal
3. 1.3 Augmenting Paths and Algorithms
4. 1.4 1-Factor Theorems
5. 1.5 Graphs Having 1-Factors
6. 1.6 Structure Theorem
7. 1.7 Algorithms for Maximum Matchings
2. 2. Regular Factors and f-Factors
1. 2.1 The f-Factor Theorem
2. 2.2 Regular Factors in Regular Graphs
3. 2.3 Regular Factors and f-Factors in Graphs
4. 2.4 Regular Factors and f-Factors in Bipartite Graphs
3. 3. (g, f)-Factors and [a, b]-Factors
1. 3.1 The (g, f)-Factor Theorem
2. 3.2 Graphs Having the Odd-Cycle Property
3. 3.3 [a, b]-Factors and (g, f)-Factors
4. 4. [a, b]-Factorizations
1. 4.1 Factorizations of Special Graphs
2. 4.2 Semi-Regular Factorization
3. 4.3 [a, b]-Factorizations of Graphs
5. 5. Parity Factors
1. 5.1 Parity (g, f)-Factors and (1, f)-Odd Factors
2. 5.2 (1, f)-Odd Subgraphs and Structure Theorem
3. 5.3 Partial parity (g, f)-factors and coverings
4. 5.4 H-Factors