𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Neighborhoods and Covering Vertices by Cycles

✍ Scribed by Mekkia Kouider

Book ID
106167868
Publisher
Springer-Verlag
Year
2000
Tongue
English
Weight
171 KB
Volume
20
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering vertices by cycles
Covering vertices by cycles
✍ Mekkia Kouider πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 900 KB

## Abstract β€œIf G is a 2‐connected graph with n vertices and minimum degree d, then the vertices of G can be covered by less than n/d cycles. This settles a conjecture of Enomoto, Kaneko and Tuza for 2‐connected graphs.”

Covering the vertices of a graph by cycl
Covering the vertices of a graph by cycles of prescribed length
✍ D. Amar; I. Fournier; A. Germa πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 321 KB

The main theorem of that paper is the following: let G be a graph of order n, of size at least (nZ -3n + 6 ) / 2 . For any integers k, n,, n2,. . . , nk such that n = n, + n2 + ... + nk and n, 2 3, there exists a covering of the vertices of G by disjoint cycles (C,),=,..,k with ICjl = n,, except whe

Covering Graphs by Cycles
Covering Graphs by Cycles
✍ Fan, Genghua πŸ“‚ Article πŸ“… 1992 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 687 KB