ON CLIQUE PARTITIONS OF SPLIT GRAPHS

被引：6
|
作者：
WALLIS, WD [1 ]
WU, J [1 ]
机构：
[1] QINGDAO UNIV, QINGDAO, PEOPLES R CHINA
来源：
DISCRETE MATHEMATICS | 1991年 / 92卷 / 1-3期
关键词：
D O I：
10.1016/0012-365X(91)90297-F
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique partition number is NP-complete, even when restricted to the class of split graphs.
引用
收藏
页码：427 / 429
页数：3
相关论文
共 50 条
12345