On the helly defect of a graph

Detalhes bibliográficos
Autor(a) principal: Dourado,Mitre C.
Data de Publicação: 2001
Outros Autores: Protti,Fábio, Szwarcfiter,Jayme L.
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Journal of the Brazilian Computer Society
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200007
Resumo: 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.
id UFRGS-28_b6526c2e4bdbce1977c6d56be67e07da
oai_identifier_str oai:scielo:S0104-65002001000200007
network_acronym_str UFRGS-28
network_name_str Journal of the Brazilian Computer Society
repository_id_str
spelling On the helly defect of a graphClique graphsclique-Helly graphsHelly defectThe 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.Sociedade Brasileira de Computação2001-01-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200007Journal of the Brazilian Computer Society v.7 n.3 2001reponame:Journal of the Brazilian Computer Societyinstname:Sociedade Brasileira de Computação (SBC)instacron:UFRGS10.1590/S0104-65002001000200007info:eu-repo/semantics/openAccessDourado,Mitre C.Protti,FábioSzwarcfiter,Jayme L.eng2003-12-16T00:00:00Zoai:scielo:S0104-65002001000200007Revistahttps://journal-bcs.springeropen.com/PUBhttps://old.scielo.br/oai/scielo-oai.phpjbcs@icmc.sc.usp.br1678-48040104-6500opendoar:2003-12-16T00:00Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)false
dc.title.none.fl_str_mv On the helly defect of a graph
title On the helly defect of a graph
spellingShingle On the helly defect of a graph
Dourado,Mitre C.
Clique graphs
clique-Helly graphs
Helly defect
title_short On the helly defect of a graph
title_full On the helly defect of a graph
title_fullStr On the helly defect of a graph
title_full_unstemmed On the helly defect of a graph
title_sort On the helly defect of a graph
author Dourado,Mitre C.
author_facet Dourado,Mitre C.
Protti,Fábio
Szwarcfiter,Jayme L.
author_role author
author2 Protti,Fábio
Szwarcfiter,Jayme L.
author2_role author
author
dc.contributor.author.fl_str_mv Dourado,Mitre C.
Protti,Fábio
Szwarcfiter,Jayme L.
dc.subject.por.fl_str_mv Clique graphs
clique-Helly graphs
Helly defect
topic Clique graphs
clique-Helly graphs
Helly defect
description 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.
publishDate 2001
dc.date.none.fl_str_mv 2001-01-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200007
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0104-65002001000200007
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0104-65002001000200007
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Computação
publisher.none.fl_str_mv Sociedade Brasileira de Computação
dc.source.none.fl_str_mv Journal of the Brazilian Computer Society v.7 n.3 2001
reponame:Journal of the Brazilian Computer Society
instname:Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
instname_str Sociedade Brasileira de Computação (SBC)
instacron_str UFRGS
institution UFRGS
reponame_str Journal of the Brazilian Computer Society
collection Journal of the Brazilian Computer Society
repository.name.fl_str_mv Journal of the Brazilian Computer Society - Sociedade Brasileira de Computação (SBC)
repository.mail.fl_str_mv jbcs@icmc.sc.usp.br
_version_ 1754734669566312448