Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Victor Neumann"'
Publikováno v:
Journal of the Brazilian Computer Society v.7 n.3 2001
Journal of the Brazilian Computer Society
Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
Journal of the Brazilian Computer Society, Volume: 7, Issue: 3, Pages: 69-73, Published: 2001
Journal of the Brazilian Computer Society
Sociedade Brasileira de Computação (SBC)
instacron:UFRGS
Journal of the Brazilian Computer Society, Volume: 7, Issue: 3, Pages: 69-73, Published: 2001
If G is a graph, its clique graph K(G) is the intersection graph of all its (maximal) cliques. The complex G of a graph G is the simplicial complex whose simplexes are the vertex sets of the complete subgraphs of G. Here we study a sufficient condi