On the helly defect of a graph

Journal of the Brazilian Computer Society

Szwarcfiter, Jayme L.¹  Dourado, Mitre C.¹  Protti, Fábio¹ 

关键词: Clique graphs;    clique-Helly graphs;    Helly defect;   

DOI  :  10.1590/S0104-65002001000200007

学科分类：农业科学（综合）

来源: Springer U K

【 摘 要 】

The Helly defect of a graph G is the smallest integer i such that the iterated clique graph Ki(G) is clique-Kelly. We prove that it is NP-hard to decide whether the Helly defect of G is at most 1.

【 授权许可】

Unknown