|
|||||
|
|
| ON (g, f)-COVERED GRAPHS | |
| 作者姓名： | 刘桂真 |
| 作者单位： | Dept.of Math.，Shandong University，Jinan |
| 摘 要： | A graph G is (g,f)-covered if each edge of G belongs to a (g,f)-factor. In this paper a necessary and sufficient condition for a graph to be (g,f)-covered is given. |
| 本文献已被 CNKI 等数据库收录！ | |