On the Existence of Critical Clique-Helly Graphs
A graph is clique-Helly if any family of mutually intersecting cliques has non-empty intersection. Dourado, Protti and Szwarcfiter conjectured that every clique-Helly graph contains a vertex whose removal maintains it a clique-Helly graph. We will present a counterexample to this conjecture.
Guardado en:
Autores principales: | Alcón, Liliana Graciela, Pizaña, Miguel, Ravenna, Gabriela Susana |
---|---|
Formato: | Articulo |
Lenguaje: | Inglés |
Publicado: |
2017
|
Materias: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/102977 |
Aporte de: |
Ejemplares similares
-
Two infinite families of critical clique-Helly graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2020) -
Faster recognition of clique-Helly and hereditary clique-Helly graphs
por: Lin, Min Chih
Publicado: (2007) -
Faster recognition of clique-Helly and hereditary clique-Helly graphs
por: Lin, M.C., et al. -
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2010) -
Biclique-Helly graphs
por: Groshaus, Marina E.
Publicado: (2007)