科研之友
微信
新浪微博
Facebook
分享链接
摘要
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: we find a poly-nomial time algorithm to decide if a given reflexive graph G, in which no two vertices have the same neighbourhood, admits a distributive lattice polymorphism.
- 出版日期2018
