Abstract
The Hamilton-Waterloo problem asks for which s and r the complete graph Kn can be decomposed into s copies of a given 2-factor F-1 and r copies of a g......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
