Abstract
A maximal complete subgraph of G is a clique. The minimum (maximum) clique number theta = theta(G) (omega = omega(G)) is the order of a minimum (maxim......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
