𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex Disjoint Cycles of Different Length in Digraphs

✍ Scribed by Henning, Michael A.; Yeo, Anders


Book ID
118197142
Publisher
Society for Industrial and Applied Mathematics
Year
2012
Tongue
English
Weight
175 KB
Volume
26
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Vertex-Disjoint Cycles of the Same Lengt
✍ Yoshimi Egawa πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 1015 KB

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.

Disjoint cycles in digraphs
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 1983 πŸ› Springer-Verlag 🌐 English βš– 209 KB
Vertex-disjoint cycles of length at most
✍ 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