Abstract
Given a collection of graphs H, a uniformly resolvable H-design of order v is a decomposition of the edges of K-v into isomorphic copies of graphs fro......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
