✦ LIBER ✦
Definability Equals Recognizability of Partial 3-Trees andsl k-Connected Partialsl k-Trees
✍ Scribed by D. Kaller
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 274 KB
- Volume
- 27
- Category
- Article
- ISSN
- 0178-4617
No coin nor oath required. For personal study only.