✦ LIBER ✦
Graph relations, clique divergence and surface triangulations
✍ Scribed by F. Larrión; V. Neumann-Lara; M.A. Pizaña
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 224 KB
- Volume
- 51
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
This work has two aims: first, we introduce a powerful technique for proving clique divergence when the graph satisfies a certain symmetry condition. Second, we prove that each closed surface admits a clique divergent triangulation. By definition, a graph is clique divergent if the orders of its iterated clique graphs tend to infinity, and the clique graph of a graph is the intersection graph of its maximal complete subgraphs. © 2005 Wiley Periodicals, Inc. J Graph Theory