✦ LIBER ✦

Saturation number of fullerene graphs

✍ Scribed by Tomislav Došlić

Book ID: 106419405
Publisher: Springer
Year: 2006
Tongue: English
Weight: 147 KB
Volume: 43
Category: Article
ISSN: 0259-9791
DOI: 10.1007/s10910-006-9217-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Saturation Numbers for Nearly Complete G

Saturation Numbers for Nearly Complete Graphs

✍ Ralph J. Faudree, Ronald J. Gould 📂 Article 📅 2012 🏛 Springer Japan 🌐 English ⚖ 208 KB

Saturation numbers for families of graph

Saturation numbers for families of graph subdivisions

✍ Michael Ferrara; Michael Jacobson; Kevin G. Milans; Craig Tennenhouse; Paul S. W 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 558 KB

Saturated graphs with minimal number of

Saturated graphs with minimal number of edges

✍ L. Kászonyi; Zs. Tuza 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

Let F = {F,, . . .} be a given class of forbidden graphs. A graph G is called F-saturated if no F, E F is a subgraph of G but the addition of an arbitrary new edge gives a forbidden subgraph. In this paper the minimal number of edges in F-saturated graphs is examined. General estimations are given a

Cycle-Saturated Graphs with Minimum Numb

Cycle-Saturated Graphs with Minimum Number of Edges

✍ Zoltán Füredi; Younjin Kim 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 563 KB

An Upper Bound for the Clar Number of Fu

An Upper Bound for the Clar Number of Fullerene Graphs

✍ Heping Zhang; Dong Ye 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 337 KB

On lower bounds of number of perfect mat

On lower bounds of number of perfect matchings in fullerene graphs

✍ Tomislav Došlić 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 46 KB