无爪 meaning in English

anonychia

In this paper almost claw - free graph is interested
其中本文感兴趣的是几乎无爪图
Circumference in three - connected claw - free graphs
连通无爪图的最长圈
Especially , if p is three , then k1 , p - confined graph is claw - free graph
特别地，当p ? 3时， hltp受限图即为无爪图
An implicit degree condition for hamiltonian cycles in k - connected claw - free graphs
连通无爪图中存在哈密尔顿圈的一个隐度条件
In the first section of chapter three , we introduce some conclusions of path problems of claw - free graph
在53中我们介绍了关于无爪图的相关路问题已有的一些结论在53

More: Next