Abstract
A chordal graph is a graph with no induced cycles of length at least 4. Let f (n, m) be the maximal integer such that every graph with n vertices and ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
