Second revised version, which contains two more chapters on component factros and spanning trees, will be published from Springer
Factors and Factorizations of Graphs (Approximately 360 pages)
by Jin Akiyama and Mikio Kano

Contents

1. 1. Basic Terminology
   1. Problems
   2. Matchings and 1-Factors
   
   1. 2.1 Matchings in Bipartite Graphs
   2. 2.2 Covers and Transversal
   3. 2.3 Augmenting Paths and Algorithms
   4. 2.4 1-Factor Theorems
   5. 2.5 Graphs Having 1-Factors
   6. 2.6 Structure Theorem
   7. 2.7 Algorithms for Maximum Matchings
   8. Problems
2. 3. Regular Factors and f-Factors
1. 3.1 The f-Factor Theorem
2. 3.2 Regular Factors in Regular Graphs
3. 3.3 Regular Factors and f-Factors in Graphs
4. 3.4 Regular Factors and f-Factors in Bipartite Graphs
5. Problems
3. 4. (g, f)-Factors and [a, b]-Factors
1. 4.1 The (g, f)-Factor Theorem
2. 4.2 Graphs Having the Odd-Cycle Property
3. 4.3 [a, b]-Factors and (g, f)-Factors
4. Problems
4. 5. [a, b]-Factorizations
1. 5.1 Factorizations of Special Graphs
2. 5.2 Semi-Regular Factorization
3. 5.3 [a, b]-Factorizations of Graphs
4. Problems
5. 6. Parity Factors
1. 6.1 Parity (g, f)-Factors and (1, f)-Odd Factors
2. 6.2 (1, f)-Odd Subgraphs and Structure Theorem
3. 6.3 Partial parity (g, f)-factors and coverings
4. 6.4 H-Factors
5. Problems
6. 7. Component Factors
1. 7.1 Path factors and star factors
2. 7.2 Cycle factors and other component factors Problems
3. Problems
7. 8. Spanning trees
1. 8.1 Preliminaries and minimum spanning trees
2. 8.2 Spanning k-trees
3. 8.3 Spanning k-ended trees
4. 8.4 Spanning trees with miscellaneous properties
References
Index