|
|||||
|
|
| REGULAR k-COVERED GRAPHS | |
| 作者姓名： | 刘桂真 |
| 作者单位： | Dept. of |
| 摘 要： | A graph G is k-covered if each edge of G belongs to a k-factor of G. We determine some valuee of k for which every r-regular graph with edge-connectivity λ is k-covered. |
| 本文献已被 CNKI 等数据库收录！ | |
|
||||||||||||||||
|
||||||||||||||||
|
||||||||||||||||
|
|
|
|
| 设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
|
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |