Graphs that are critical with respect to matching extension and diameter
Let G be a simple connected graph on 2n vertices with a perfect matching. For 1 ≤ k ≤ n - 1, G is said to be k-extendable if for every matching M of size k in G there is a perfect matching in G containing all the edges of M. A k-extendable graph G is said to be k-critical (k-minimal) if G+uv (G-uv)...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
Curtin University
1994
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/204 |