Sparse graphs usually have exponentially many optimal colorings.
The Electronic Journal of Combinatorics [electronic only] (2002)
- Volume: 9, Issue: 1, page Research paper R27, 8 p.-Research paper R27, 8 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topKrivelevich, Michael. "Sparse graphs usually have exponentially many optimal colorings.." The Electronic Journal of Combinatorics [electronic only] 9.1 (2002): Research paper R27, 8 p.-Research paper R27, 8 p.. <http://eudml.org/doc/121889>.
@article{Krivelevich2002,
author = {Krivelevich, Michael},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {chromatic number; random graph; optimal colorings},
language = {eng},
number = {1},
pages = {Research paper R27, 8 p.-Research paper R27, 8 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Sparse graphs usually have exponentially many optimal colorings.},
url = {http://eudml.org/doc/121889},
volume = {9},
year = {2002},
}
TY - JOUR
AU - Krivelevich, Michael
TI - Sparse graphs usually have exponentially many optimal colorings.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2002
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 9
IS - 1
SP - Research paper R27, 8 p.
EP - Research paper R27, 8 p.
LA - eng
KW - chromatic number; random graph; optimal colorings
UR - http://eudml.org/doc/121889
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.