- Current Issue - Ahead of Print Articles - All Issues - Search - Open Access - Information for Authors - Downloads - Guideline - Regulations ㆍPaper Submission ㆍPaper Reviewing ㆍPublication and Distribution - Code of Ethics - For Authors ㆍOnlilne Submission ㆍMy Manuscript - For Reviewers - For Editors
 Distributive lattice polymorphisms on reflexive graphs Bull. Korean Math. Soc. 2018 Vol. 55, No. 1, 81-105 https://doi.org/10.4134/BKMS.b160853Published online January 31, 2018 Mark Siggers Kyungpook National University Abstract : In this paper we give two characterisations of the class of reflexive graphs admitting {\em distributive lattice polymorphisms} and use these characterisations to address the problem of recognition: we find a polynomial time algorithm to decide if a given reflexive graph $G$, in which no two vertices have the same neighbourhood, admits a distributive lattice polymorphism. Keywords : lattice polymorphism, CSP, distributive lattice, reflexive graph, recognition MSC numbers : 05C75, 08B05 Downloads: Full-text PDF