Abstract
In this paper we give two characterisations of the class of reexive graphs admitting distributive lattice polymorphisms and use these characterisa- tions to attack the problem of nding a polynomial time recognition algorithm for these graphs. We provide a polynomial time recognition algorithm for R-thin reexive graphs which admit what we call Type 2 distributive lattice polymorphisms.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
