Abstract
A graph G is called triangle-free if G does not contain a triangle as an induced subgraph. Let H-n be the set of triangle-free graphs of order n with ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
