Sciweavers

Share
COMBINATORICS
2002

Sparse Graphs Usually Have Exponentially Many Optimal Colorings

9 years 11 months ago
Sparse Graphs Usually Have Exponentially Many Optimal Colorings
Michael Krivelevich
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2002
Where COMBINATORICS
Authors Michael Krivelevich
Comments (0)
books