On the complexity of bicoloring clique hypergraphs of graphs

被引：46
|
作者：
Kratochvíl, J
Tuza, Z
机构：
[1] Charles Univ Prague, Dept Appl Math, CR-11800 Prague, Czech Republic
[2] Charles Univ Prague, Inst Theoret Comp Sci, CR-11800 Prague, Czech Republic
[3] Hungarian Acad Sci, Inst Comp & Automat, H-1111 Budapest, Hungary
来源：
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC | 2002年 / 45卷 / 01期
基金：
匈牙利科学研究基金会;
关键词：
D O I：
10.1016/S0196-6774(02)00221-3
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Given a graph G, its clique hypergraph C(G) has the same set of vertices as G and the hyperedges correspond to the (inclusionwise) maximal cliques of G. We consider the question of bicolorability of C(G). i.e., whether the vertices of G can be colored with two colors so that no maximal clique is monochromatic. Our two main results say that deciding the bicolorability of C(G) is NP-hard for perfect graphs (and even for those with clique number 3), but solvable in polynomial time for planar graphs. (C) 2002 Elsevier Science (USA). All rights reserved.
引用
收藏
页码：40 / 54
页数：15
相关论文
共 50 条
12345