𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Atoms of cyclic edge connectivity in regular graphs

✍ Scribed by Zhou, Jin-Xin

Book ID
125363160
Publisher
Springer US
Year
2014
Tongue
English
Weight
456 KB
Volume
31
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower bound of cyclic edge connectivity
Lower bound of cyclic edge connectivity for n-extendability of regular graphs
✍ Dingjun Lou; D.A. Holton πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 701 KB

A cyclically m-edge-connected n-connected k-regular graph is called an (m.n.k) graph. It is proved that for any m > 0 and k 2 3, there is an (m, k, k) bipartite graph. A graph G is n-extendable if every matching of size n in G lies in a perfect matching of G. We prove the existence of a (k2-1, k + 1