✦ LIBER ✦
Finding Shortest Non-Separating and Non-Contractible Cycles for Topologically Embedded Graphs
✍ Scribed by Sergio Cabello; Bojan Mohar
- Publisher
- Springer
- Year
- 2007
- Tongue
- English
- Weight
- 336 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.