Abstract
Let P-n be a path graph on n vertices. We say that a graph G is P-n-induced-saturated if G contains no induced copy of P-n, but deleting any edge of G......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
