𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Twenty-year index – Volumes 1–20


Book ID
111570252
Publisher
Springer
Year
2003
Tongue
English
Weight
464 KB
Volume
20
Category
Article
ISSN
0889-048X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Cumulative Index for Volumes 1–20
📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 255 KB

Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. 9: 507-537 CHIBA, NORISHIGE, AND NISHIZEKI, TAKAO. The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs. 10: 187-211 , , AND SAITO, NOBUJI. A linear 5-coloring algorithm of plana