将图划分为不相交团与无三角形子图的 NP 难性结果
离散数学
2014-04-10 v3 计算复杂性
摘要
本文研究了判定图的顶点集能否划分为不相交团与一个无三角形子图的并集的计算复杂性。该问题在任意图上已知是 -完全的。我们证明了即使限制在平面图和完美图上，该问题仍然是 -完全的。
引用
@article{arxiv.1403.5248,
title = {NP-hardness results for partitioning graphs into disjoint cliques and a triangle-free subgraph},
author = {Carl Feghali and Faisal N. Abu-Khzam and Haiko Müller},
journal= {arXiv preprint arXiv:1403.5248},
year = {2014}
}
备注
10 pages, 4 figures. The results in this paper can now be found, including further results, in our submission entitled "On the Complexity of Partitioning a Graph into Disjoint Cliques and a Triangle-free Subgraph", arXiv:1403.5961