Matchings, factors and cycles in graphs
A matching in a graph is a set of pairwise nonadjacent edges, a k-factor is a k-regular spanning subgraph, and a cycle is a closed path. This thesis has two parts. In Part I (by far the larger part) we study sufficient conditions for structures involving matchings, factors and cycles. The three mai...
| Main Author: | |
|---|---|
| Format: | Thesis (University of Nottingham only) |
| Language: | English |
| Published: |
2008
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/10530/ |