𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cyclic edge-cuts in fullerene graphs

✍ Scribed by František Kardoš; Riste Škrekovski

Publisher
Springer
Year
2007
Tongue
English
Weight
473 KB
Volume
44
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cyclic 7-edge-cuts in fullerene graphs
Cyclic 7-edge-cuts in fullerene graphs
✍ František Kardoš; Matjaž Krnc; Borut Lužar; Riste Škrekovski 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 769 KB
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

Edge-packing planar graphs by cyclic gra
Edge-packing planar graphs by cyclic graphs
✍ Lenwood S. Heath; John Paul C. Vergara 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 749 KB

Maximum G edge-packing is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. This paper considers the cases where G and H are planar and G is cyclic. Recent work on the general problem is surveyed, inadequacies and limitations in