𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Extraconnectivity of graphs with large minimum degree and girth

✍ Scribed by C. Balbuena; A. Carmona; J. Fàbrega; M.A. Fiol

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
824 KB
Volume
167-168
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cycle lengths in graphs with large minim
Cycle lengths in graphs with large minimum degree
✍ V. Nikiforov; R. H. Schelp 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views

## Abstract Our main result is the following theorem. Let __k__ ≥ 2 be an integer, __G__ be a graph of sufficiently large order __n__, and __δ__(__G__) ≥ __n__/__k__. Then: __G__ contains a cycle of length __t__ for every even integer __t__ ∈ [4, __δ__(__G__) + 1]. If __G__ is nonbipartite then

The number of cycle lengths in graphs of
The number of cycle lengths in graphs of given minimum degree and girth
✍ P. Erdős; R.J. Faudree; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 333 KB

This paper determines lower bounds on the number of different cycle lengths in a graph of given minimum degree k and girth g. The most general result gives a lower bound of ck ~.

Graphs of Prescribed Girth and Bi-Degree
Graphs of Prescribed Girth and Bi-Degree
✍ Z. Furedi; F. Lazebnik; A. Seress; V.A. Ustimenko; A.J. Woldar 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 426 KB
UniquelyH-colorable graphs with large gi
UniquelyH-colorable graphs with large girth
✍ Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB 👁 2 views

Suppose G and H are graphs. We say G is H-colorable if there is a homomorphism (edge-preserving vertex mapping) from G to H. We say a graph G is uniquely H-colorable if there is an onto homomorphism c from G to H, and any other homomorphism from G to H is the composition o o c of c with an automorph