Title of article
Clique Divergent Clockwork Graphs and Partial Orders
Author/Authors
Larriَn، نويسنده , , F. and Neumann-Lara، نويسنده , , V. and Pizana، نويسنده , , M.A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
4
From page
10
To page
13
Abstract
S. Hazan 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 the converse is true. In this work we answer that question in the negative by exhibiting a finite poset with the fixed point property whose comparability graph is clique-divergent.
Keywords
clique divergence , Key words: iterated clique graphs , Fixed point property
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453068
Link To Document