Abstract
A graph without induced subgraphs isomorphic to a path of length 3 is P-4-free. If a graph G contains two spanning trees T-1, T-2 such that for each t......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
