194 citations · 218 across the 4 of their papers we have counts for
1 paper · 1 filter
R. Mulet, A. Pagnani, M. Weigt +1
We study the graph coloring problem over random graphs of finite average connectivity c. Given a number q of available colors, we find that graphs with low connectivity admit a…