|
|||||
|
|
Covering cycles andk-term degree sums |
|
| Authors: | Mekkia Kouider Zbigniew Lonc |
| Affiliation: | (1) Laboratoire de Recherche en Informatique, Université de Paris-Sud, Orsay, France;(2) Institute of Mathematics, Warsaw University of Technology, Warsaw, Poland |
| Abstract: | We show that if  , for every stable set , then the vertex set ofG can be covered withk–1 cycles, edges or vertices. This settles a conjecture by Enomoto, Kaneko and Tuza. |
| Keywords: | 05 C 38 05 C 70 |
| 本文献已被 SpringerLink 等数据库收录！ | |