Cycles in graphs with prescribed stability number and connectivity
Journal of Combinatorial Theory Series B
On independent cycles and edges in graphs
Discrete Mathematics
Basic graph theory: paths and circuits
Handbook of combinatorics (vol. 1)
Graph Theory With Applications
Graph Theory With Applications
Minimum degree, independence number and pseudo [2,b]-factors in graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |
We show that a graph with minimum degree @d, independence number @a=@d and without isolated vertices, possesses a partition by vertex-disjoint cycles and at most @a-@d+1 edges or vertices.