Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Victor Neumann"'
Publikováno v:
European Journal of Combinatorics. (2):372-379
The clique graph K(G) of a graph G, is the intersection graph of its (maximal) cliques, and G is K-divergent if the orders of its iterated clique graphs K(G),K2(G),K3(G),… tend to infinity. A coaffine graph has a symmetry that maps each vertex outs