Abstract
A graph is called t-perfect if its stable set polytope is fully described by nonnegativity, edge, and odd-cycle constraints. We characterize P-5-free ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
