Abstract
Let G be a graph. Adopting the terminology of Broersma et al. and Cada, respectively, we say that G is 2-heavy if every induced claw (K-1,K-3) of G co......
小提示:本篇文献需要登录阅读全文,点击跳转登录