induced matching cover 导出匹配覆盖
induced matching number 导出匹配数
induced matching partition 导出匹配划分
Induced matching partition number 导出匹配划分数
self induced phase matching 自诱导相位匹配
self-induced phase matching 自诱导相位匹配
Theorem 1. The induced matching 2-partition problem for graphs having diameter 6 is NP-complete.
定理1.直径为6的图的导出匹配2-划分问题是NP-完全的。
参考来源 - 图的广义着色·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐