Convergence of iterated clique graphs
Discrete Mathematics
Clique divergent graphs with unbounded sequence of diameters
Discrete Mathematics
Locally C6 graphs are clique divergent
Discrete Mathematics
On clique divergent graphs with linear growth
Discrete Mathematics
The icosahedron is clique divergent
Discrete Mathematics
Edge contraction and edge removal on iterated clique graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
S. Hazan and V. Neumann-Lara proved in 1996 that every finite partially ordered set whose comparability graph is clique null has the fixed point property and they asked whether there is a finite poset with the fixed point property whose comparability graph is clique divergent. In this work we answer that question by exhibiting such a finite poset. This is achieved by developing further the theory of clockwork graphs. We also show that there are polynomial time algorithms that recognize clockwork graphs and decide whether they are clique divergent.