Distributive Lattice Polymorphism on Reflexive Graphs
classification
🧮 math.CO
keywords
distributivelatticereflexivecharacterisationsgraphspolymorphismaddressadmits
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.