Distributive Lattice Polymorphism on Reflexive Graphs
Combinatorics
2018-01-30 v2
Abstract
In this paper we give two characterisations of the class of reflexive graphs admitting distributive lattice polymorphisms and use these characterisations to address the problem of recognition: for a reflexive graph G in which no two vertices have the same neighbourhood, we find a polynomial time algorithm to decide if G admits a distributive lattice polymorphism.
Keywords
Cite
@article{arxiv.1411.7879,
title = {Distributive Lattice Polymorphism on Reflexive Graphs},
author = {Mark Siggers},
journal= {arXiv preprint arXiv:1411.7879},
year = {2018}
}
Comments
20 pages, 6 figures