Acessibilidade / Reportar erro
• J. Braz. Comp. Soc. 7 (3) • 2001 • https://doi.org/10.1590/S0104-65002001000200007   copy

On the helly defect of a graph

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.

Clique graphs; clique-Helly graphs; Helly defect

Sociedade Brasileira de Computação Sociedade Brasileira de Computação - UFRGS, Av. Bento Gonçalves 9500, B. Agronomia, Caixa Postal 15064, 91501-970 Porto Alegre, RS - Brazil, Tel. / Fax: (55 51) 316.6835 - Campinas - SP - Brazil
E-mail: jbcs@icmc.sc.usp.br
Acompanhe os números deste periódico no seu leitor de RSS