𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex-Disjoint Cycles of the Same Length

✍ Scribed by Yoshimi Egawa

Book ID
102970709
Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
1015 KB
Volume
66
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

✦ Synopsis

We show that for each integer k 3, there exists an integer p k such that every graph with minimum degree at least 2k and order at least p k contains k pairwise vertex-disjoint cycles of the same length.

πŸ“œ SIMILAR VOLUMES

Vertex-disjoint cycles of length at most
Vertex-disjoint cycles of length at most four each of which contains a specified vertex
✍ Yoshiyas Ishigami πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 157 KB

## Abstract We obtain a sharp minimum degree condition Ξ΄ (G) β‰₯ $\lfloor {\sqrt {\phantom{n^2}n+k^2-3k+1}}\rfloor + 2k-1$ of a graph __G__ of order __n__ β‰₯ 3__k__ guaranteeing that, for any __k__ distinct vertices, __G__ contains __k__ vertex‐disjoint cycles of length at most four each of which cont

Vertex disjoint routings of cycles over
Vertex disjoint routings of cycles over tori
✍ Jean-Claude Bermond; Min-Li Yu πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 209 KB

## Abstract We study the problem of designing a survivable WDM network based on covering the communication requests with subnetworks that are protected independently from each other. We consider here the case when the physical network is __T__(__n__), a torus of size __n__ by __n__, the subnetworks