Abstract
A graph K is square-free if it contains no four-cycle as a subgraph (i.e., for every quadruple of vertices, if v(0)v(1) v(1)v(2), v(2)v(3), v(3)v(0) i......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
