%0 Journal Article
%A Michael Krivelevich
%T Sparse graphs usually have exponentially many optimal colorings
%J The electronic journal of combinatorics
%D 2002
%V 9
%U http://geodesic.mathdoc.fr/articles/10.37236/1643/
%R 10.37236/1643
%F 10_37236_1643