𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cycle-Saturated Graphs with Minimum Number of Edges

✍ Scribed by Zoltán Füredi; Younjin Kim

Book ID
115558799
Publisher
John Wiley and Sons
Year
2012
Tongue
English
Weight
563 KB
Volume
73
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 of minimum size
Cycle-saturated graphs of minimum size
✍ C.A. Barefoot; L.H. Clark; R.C. Entringer; T.D. Porter; L.A. Székely; Zs. Tuza 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 707 KB

A graph G is called Ck-saturated if G contains no cycles of length k but does contain such a cycle after the addition of any new edge. Bounds are obtained for the minimum number of edges in Ck-saturated graphs for all k ~ 8 or 10 and n sufficiently large. In general, it is shown that the minimum is