1. Abian, S., Brown, A.B.: A theorem on partially ordered sets with applications to fixed point theorems. Canad. J. Math. 13, 78–82 (1961)
2. Debruyne, R., Bessière, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: Proceedings of the 15th IJCAI international joint conference on artificial intelligence. IJCAI, pp 412–417 (1997)
3. Duffus, D., Goddard, T.: The complexity of the fixed point property. Order 13, 209–218 (1996)
4. Hazan, S., Neumann-Lara, V.: Fixed points of posets and clique graphs. Order 13, 219–225 (1995)
5. Hell, P., Nešetril, J.: Graphs and homomorphisms. Oxford lecture series in mathematics and its applications 28. Oxford University Press, Oxford (2004)