Abstract
It is a well-known conjecture that if a regular simple graph G of order 2n has degree Delta(G) satisfying Delta(G) >= n, then G is 1-factorizable. ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
