|
|||||
|
|
A Note on Matchings and Spanning Trees with Bounded Degrees |
|
| Authors: | Eduardo Rivera-Campo |
| Affiliation: | 1. Departamento de Matemáticas, Universidad Autónoma Metropolitana-I, Apto. 55-534, México D.F., 09340, Mexico |
| Abstract: | If M is a perfect matching in a k-connected graph G with independence number (alpha le 1 + {3 over 2}k) , then M can be extended to a spanning tree of G with maximum degree at most three. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |