Matching theory: subgraphs with degree constraints and other properties
In this thesis, three generalizations of the matching problem are considered. The first problem is the existence of matrices with given row and column sums. This problem can be interpreted as the f-factor problem of a bipartite graph. The well-known existence theorem follows from maxfiow-mincut t...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
2009
|
| Online Access: | http://hdl.handle.net/2429/6938 |