✦ LIBER ✦

Some results onR2-edge-connectivity of even regular graphs

✍ Scribed by Junming Xu

Book ID: 107502189
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 1999
Tongue: English
Weight: 267 KB
Volume: 14
Category: Article
ISSN: 1005-1031
DOI: 10.1007/s11766-999-0047-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Super Restricted Edge Connectivity of Re

Super Restricted Edge Connectivity of Regular Graphs

✍ Ou Jianping; Fuji Zhang 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 244 KB

Eigenvalues and edge-connectivity of reg

Eigenvalues and edge-connectivity of regular graphs

✍ Sebastian M. Cioabă 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Results on the edge-connectivity of grap

Results on the edge-connectivity of graphs

✍ Linda Lesniak 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 338 KB

Erratum to “Eigenvalues and edge-connect

Erratum to “Eigenvalues and edge-connectivity of regular graphs”

✍ Sebastian M. Cioab 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 48 KB

On 4-chromatic edge-critical regular gra

On 4-chromatic edge-critical regular graphs of high connectivity

✍ Andrey A. Dobrynin; Leonid S. Melnikov; Artem V. Pyatkin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 81 KB

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