On clique‐inverse graphs of graphs with bounded clique number
The clique graph K(G) of G is the intersection graph of the family of maximal cliques of G. For a family F of graphs, the family of clique-inverse graphs of F, denoted by K−1(F), is defined as K−1(F) = {H|K(H) ∈ F}. Let F p be the family of Kp-free graphs, that is, graphs with clique number at most...
Guardado en:
| Autores principales: | Alcón, Liliana Graciela, Gravier, Sylvain, Linhares Sales, Cláudia, Protti, Fábio, Ravenna, Gabriela Susana |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/129017 |
| Aporte de: |
Ejemplares similares
-
On the Existence of Critical Clique-Helly Graphs
por: Alcón, Liliana Graciela, et al.
Publicado: (2017) -
A sufficient condition for self-clique graphs
por: Bondy, A., et al. -
A sufficient condition for self-clique graphs
por: Durán, Guillermo A., et al.
Publicado: (2000) -
The difference between clique graphs and iterated clique graphs
por: De Caria, Pablo Jesús
Publicado: (2011) -
On clique-perfect and K-perfect graphs
por: Bonomo, F., et al.