Two infinite families of critical clique-Helly graphs

Buscar material

Busque entre los 156529 recursos disponibles en el repositorio

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

dc.date.accessioned	2021-09-16T13:50:29Z
dc.date.available	2021-09-16T13:50:29Z
dc.date.issued	2020
dc.identifier.uri	http://sedici.unlp.edu.ar/handle/10915/124932
dc.description.abstract	A graph is clique–Helly if every family of pairwise intersecting (maximal) cliques has non-empty total intersection. Dourado, Protti and Szwarcfiter conjectured that every clique–Helly graph contains a vertex whose removal maintains it as a clique–Helly graph. We present here two infinite families of counterexamples to this conjecture.	en
dc.format.extent	2-5	es
dc.language	en	es
dc.subject	Helly property	es
dc.subject	Clique-Helly graphs	es
dc.subject	Clique graphs	es
dc.title	Two infinite families of critical clique-Helly graphs	en
dc.type	Articulo	es
sedici.identifier.other	doi:10.1016/j.dam.2019.06.025	es
sedici.identifier.issn	0166-218x	es
sedici.creator.person	Alcón, Liliana Graciela	es
sedici.creator.person	Pizaña, Miguel A.	es
sedici.creator.person	Ravenna, Gabriela Susana	es
sedici.subject.materias	Ciencias Exactas	es
sedici.subject.materias	Física	es
sedici.description.fulltext	true	es
mods.originInfo.place	Instituto de Física La Plata	es
sedici.subtype	Articulo	es
sedici.rights.license	Creative Commons Attribution 4.0 International (CC BY 4.0)
sedici.rights.uri	http://creativecommons.org/licenses/by/4.0/
sedici.description.peerReview	peer-review	es
sedici.relation.journalTitle	Discrete Applied Mathematics	es
sedici.relation.journalVolumeAndIssue	vol. 281	es

Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution 4.0 International (CC BY 4.0)