On split clique graphs

Autores
Alcón, Liliana Graciela; Faria, Luerbio; Miraglia Herrera De Figueiredo, Celina; Gutiérrez, Marisa
Año de publicación
2010
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
A complete set of a graph G is a subset of VG whose elements are pairwise adjacent. A clique is a maximal complete set. The clique graph of G, denoted by K(G), is the intersection graph of the family of cliques of G. The clique graph recognition problem asks whether a given graph is a clique graph. This problem was classified recently as NP-complete after being open for 30 years. The complexity of this decision problem is open for very structured and well studied classes of graphs such as planar graphs and chordal graphs. We propose the study of split clique graphs.
Facultad de Ciencias Exactas
Departamento de Matemática
Materia
Ciencias Exactas
Matemática
clique graphs
split graphs
recognition problems
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/162604
Acceder
id SEDICI_401aaba36218def62a917ee874e807e8
oai_identifier_str oai:sedici.unlp.edu.ar:10915/162604
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling On split clique graphsAlcón, Liliana GracielaFaria, LuerbioMiraglia Herrera De Figueiredo, CelinaGutiérrez, MarisaCiencias ExactasMatemáticaclique graphssplit graphsrecognition problemsA complete set of a graph G is a subset of VG whose elements are pairwise adjacent. A clique is a maximal complete set. The clique graph of G, denoted by K(G), is the intersection graph of the family of cliques of G. The clique graph recognition problem asks whether a given graph is a clique graph. This problem was classified recently as NP-complete after being open for 30 years. The complexity of this decision problem is open for very structured and well studied classes of graphs such as planar graphs and chordal graphs. We propose the study of split clique graphs.Facultad de Ciencias ExactasDepartamento de Matemática2010info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf85-91http://sedici.unlp.edu.ar/handle/10915/162604enginfo:eu-repo/semantics/altIdentifier/url/http://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2021/12/39-10.pdfinfo:eu-repo/semantics/altIdentifier/issn/2317-6636info:eu-repo/semantics/altIdentifier/doi/10.21711/231766362010/rmc3910info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T11:14:41Zoai:sedici.unlp.edu.ar:10915/162604Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 11:14:41.849SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv On split clique graphs
title On split clique graphs
spellingShingle On split clique graphs
Alcón, Liliana Graciela
Ciencias Exactas
Matemática
clique graphs
split graphs
recognition problems
title_short On split clique graphs
title_full On split clique graphs
title_fullStr On split clique graphs
title_full_unstemmed On split clique graphs
title_sort On split clique graphs
dc.creator.none.fl_str_mv Alcón, Liliana Graciela
Faria, Luerbio
Miraglia Herrera De Figueiredo, Celina
Gutiérrez, Marisa
author Alcón, Liliana Graciela
author_facet Alcón, Liliana Graciela
Faria, Luerbio
Miraglia Herrera De Figueiredo, Celina
Gutiérrez, Marisa
author_role author
author2 Faria, Luerbio
Miraglia Herrera De Figueiredo, Celina
Gutiérrez, Marisa
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Exactas
Matemática
clique graphs
split graphs
recognition problems
topic Ciencias Exactas
Matemática
clique graphs
split graphs
recognition problems
dc.description.none.fl_txt_mv A complete set of a graph G is a subset of VG whose elements are pairwise adjacent. A clique is a maximal complete set. The clique graph of G, denoted by K(G), is the intersection graph of the family of cliques of G. The clique graph recognition problem asks whether a given graph is a clique graph. This problem was classified recently as NP-complete after being open for 30 years. The complexity of this decision problem is open for very structured and well studied classes of graphs such as planar graphs and chordal graphs. We propose the study of split clique graphs.
Facultad de Ciencias Exactas
Departamento de Matemática
description A complete set of a graph G is a subset of VG whose elements are pairwise adjacent. A clique is a maximal complete set. The clique graph of G, denoted by K(G), is the intersection graph of the family of cliques of G. The clique graph recognition problem asks whether a given graph is a clique graph. This problem was classified recently as NP-complete after being open for 30 years. The complexity of this decision problem is open for very structured and well studied classes of graphs such as planar graphs and chordal graphs. We propose the study of split clique graphs.
publishDate 2010
dc.date.none.fl_str_mv 2010
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/162604
url http://sedici.unlp.edu.ar/handle/10915/162604
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/http://mc.sbm.org.br/wp-content/uploads/sites/9/sites/9/2021/12/39-10.pdf
info:eu-repo/semantics/altIdentifier/issn/2317-6636
info:eu-repo/semantics/altIdentifier/doi/10.21711/231766362010/rmc3910
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
85-91
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260651766972416
score 13.13397

Publicaciones similares