Connected [a,b]-factors in Graphs |
| |
| Authors: | Mekkia Kouider Maryvonne Mahéo |
| |
| Affiliation: | (1) URA 410 L.R.I., Bat. 490, Universite Paris-Sud; 91405 Orsay, France; E-mail: km@lri.fr, FR;(2) URA 410 L.R.I., Bat. 490, Universite Paris-Sud; 91405 Orsay, France; E-mail: maheo@lri.fr, FR |
| |
| Abstract: | In this paper, we prove the following result: Let G be a connected graph of order n, and minimum degree . Let a and b two integers such that 2a <= b. Suppose and . Then G has a connected [a,b]-factor. Received February 10, 1998/Revised July 31, 2000 |
| |
| Keywords: | AMS Subject Classification (2000) Classes: 05C70 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
