2 citations · 2 across the 3 of their papers we have counts for
1 paper · 2 filters
Anders Martinsson, Konstantinos Panagiotou, Pascal Su +1
The chromatic number χ(G) of a graph G, that is, the smallest number of colors required to color the vertices of G so that no two adjacent vertices are assigned the same colo…