✦ LIBER ✦
Finding Maximum Induced Matchings in Subclasses of Claw-Free andP5-Free Graphs, and in Graphs with Matching and Induced Matching of Equal Maximum Size
✍ Scribed by Daniel Kobler; Udi Rotics
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 489 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.