| A DEGREE CONDITION FOR THE EXISTENCE OF CONNECTED [k, k 1]-FACTORS |
| |
| 作者姓名： | CAI Maocheng |
| |
| 作者单位： | Institute of Systems Science，Academia Sinica，Beijing 100080，China |
| |
| 摘 要： | ＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－ＦＡＣＴＯＲＳＡＤＥＧＲＥＥＣＯＮＤＩＴＩＯＮＦＯＲＴＨＥＥＸＩＳＴＥＮＣＥＯＦＣＯＮＮＥＣＴＥＤ［ｋ，ｋ＋１］－ＦＡＣＴＯＲＳ￥ＣＡＩＭａｏｃｈｅｎ...
|
A DEGREE CONDITION FOR THE EXISTENCE OF CONNECTED [k, k 1]-FACTORS |
| |
| CAI Maocheng.A DEGREE CONDITION FOR THE EXISTENCE OF CONNECTED [k, k 1]-FACTORS[J].Journal of Systems Science and Complexity,1995(4). |
| |
| Authors: | CAI Maocheng |
| |
| Abstract: | The following result is proved in this paper.Let k be an integer > 2 2 and G be a connected graph of order n.If G has a k-factor F and,moreover, among any three independent venices of G there are(at least)two venices with degree sum at least n-k,then G has a matching M such that M and F are edge-disjoint and M F is a connected k,k 1]-factor of G.As immediate consequences,the result gives a solution to a problem and a proof to a conjecture of Kano on the existence of connected k, k 1]-factor. |
| |
| Keywords: | Connected factor matching graph |
| 本文献已被 CNKI 等数据库收录！ |
