Abstract
A strict bramble of a graph G is a collection of pairwise-intersecting connected sub graphs of G. The order of a strict bramble B is the minimum size ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
