Abstract
Let n, k and l be integers with 1 <= k<= n-1. The set-inclusion graph G(n,k,l) is the graph whose vertex set consists of all k- and l-subsets of......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
