Abstract
Lovasz (1965) characterized graphs without two vertex-disjoint cycles, which implies that such graphs have at most three vertices hitting all cycles. ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
