𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cyclic 7-edge-cuts in fullerene graphs

✍ Scribed by František Kardoš; Matjaž Krnc; Borut Lužar; Riste Škrekovski

Publisher
Springer
Year
2009
Tongue
English
Weight
769 KB
Volume
47
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

T-joins intersecting small edge-cuts in
T-joins intersecting small edge-cuts in graphs
✍ Tomáš Kaiser; Riste Škrekovski 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract In an earlier paper 3, we studied cycles in graphs that intersect all edge‐cuts of prescribed sizes. Passing to a more general setting, we examine the existence of __T__‐joins in grafts that intersect all edge‐cuts whose size is in a given set __A__ ⊆{1,2,3}. In particular, we character