SciELO - Scientific Electronic Library Online

 
vol.7 issue3Edge-clique graphs and the lambda-coloring problemAlgebraic theory for the clique operator author indexsubject indexarticles search
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

Share


Journal of the Brazilian Computer Society

Print version ISSN 0104-6500On-line version ISSN 1678-4804

Abstract

DOURADO, Mitre C.; PROTTI, Fábio  and  SZWARCFITER, Jayme L.. On the helly defect of a graph. J. Braz. Comp. Soc. [online]. 2001, vol.7, n.3, pp.48-52. ISSN 0104-6500.  http://dx.doi.org/10.1590/S0104-65002001000200007.

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.

Keywords : Clique graphs; clique-Helly graphs; Helly defect.

        · text in English     · English ( pdf epdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License