𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rainbow k-connection in Dense Graphs (Extended Abstract)

✍ Scribed by Shinya Fujita; Henry Liu; Colton Magnant


Book ID
119236581
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
186 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Rainbow vertex -connection in graphs
✍ Liu, Henry; Mestre, Γ‚ngela; Sousa, Teresa πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 683 KB
Connectivity of k-extendable graphs with
✍ Dingjun Lou; Qinglin Yu πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 198 KB

Let G be a simple connected graph on 2n vertices with perfect matching. For a given positive integer k (0 , then either G is bipartite or the connectivity of G is at least 2k. As a corollary, we show that if G is a maximal k-extendable graph on 2n vertices with n + 2 6 2k + 1, then G is Kn;n if k +