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

Contact ORBi UMONS