|
|||||
|
|
Maximal tight sets and the edmonds—Gallai decomposition for matchings |
|
| Authors: | K Steffens |
| Institution: | 1. Inst. für Mathematik, Universit?t Hannover, Welfengarten 1, 3000, Hannover, Germany |
| Abstract: | The Edmonds—Gallai decomposition theorem for matchings of finite or locally finite graphs is generalized to matchings of the kernel of an arbitrary graph. |
| Keywords: | 04 A 20 05 A 05 |
| 本文献已被 SpringerLink 等数据库收录！ | |