Sparse graphs usually have exponentially many optimal colorings.
Krivelevich, Michael
The Electronic Journal of Combinatorics [electronic only], Tome DS10 (2002), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2002-01-01
EUDML-ID : urn:eudml:doc:121889 
@article{01757093,
     title = {Sparse graphs usually have exponentially many optimal colorings.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {DS10},
     year = {2002},
     zbl = {0989.05106},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01757093}
}

Krivelevich, Michael. Sparse graphs usually have exponentially many optimal colorings.. The Electronic Journal of Combinatorics [electronic only], Tome DS10 (2002) . http://gdmltest.u-ga.fr/item/01757093/