A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree

Romain Absil, Eglantine Camby, Alain Hertz, Hadrien Mélot. A sharp lower bound on the number of non-equivalent colorings of graphs of order and maximum degree. Discrete Applied Mathematics, 234:3-11, 2018. [doi]

Abstract

Abstract is missing.