Abstract
A graph is l-reconstructible if it is determined by its multiset of induced subgraphs obtained by deleting l vertices. We prove that 3-regular graphs ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
