Soheil Feizi, Muriel Médard. Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem. In IEEE International Symposium on Information Theory, ISIT 2010, June 13-18, 2010, Austin, Texas, USA, Proceedings. pages 116-120, IEEE, 2010. [doi]
Abstract is missing.