| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 419753 | Discrete Applied Mathematics | 2009 | 6 Pages |
Abstract
We show that a graph with minimum degree δδ, independence number α≥δα≥δ and without isolated vertices, possesses a partition by vertex-disjoint cycles and at most α−δ+1α−δ+1 edges or vertices.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Siham Bekkai, Mekkia Kouider,