Clique-critical graphs: Maximum size and recognition
The clique graph of G, K (G), is the intersection graph of the family of cliques (maximal complete sets) of G. Clique-critical graphs were defined as those whose clique graph changes whenever a vertex is removed. We prove that if G has m edges then any clique-critical graph in K<SUB>-1</SUB...
Guardado en:
| Autor principal: | Alcón, Liliana Graciela |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/83201 |
| Aporte de: |
Ejemplares similares
-
The complexity of clique graph recognition
por: Alcón, Liliana Graciela, et al.
Publicado: (2009) -
Split clique graph complexity
por: Alcón, Liliana Graciela, et al.
Publicado: (2013) -
On maximizing clique, clique-Helly and hereditary clique-Helly induced subgraphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2010) -
Two infinite families of critical clique-Helly graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2020) -
On clique‐inverse graphs of graphs with bounded clique number
por: Alcón, Liliana Graciela, et al.
Publicado: (2020)