| Article ID: | iaor20023716 |
| Country: | United States |
| Volume: | 37 |
| Issue: | 4 |
| Start Page Number: | 194 |
| End Page Number: | 201 |
| Publication Date: | Jun 2001 |
| Journal: | Networks |
| Authors: | Jungnickel Dieter, Fremuth-Paeger Christian |
| Keywords: | duality |
In this paper, we present a theory for generalized graph factor problems which is basically equivalent to Chapter 10 in Lovasz/Plummer but considerably more intuitive since it uses the language of balanced network flows. The highlights are extensions of the Gallai–Edmonds decomposition and an intuitive development of Lovasz's factor theorem.