2 citations · 2 across the 2 of their papers we have counts for
Showing math.COShow all
2 papers · 1 filter
math.CO2007★ 1 cited
Graph coloring with no large monochromatic components
N. Linial, J. Matousek, O. Sheffet +1
For a graph G and an integer t we let mcc_t(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having…
math.CO2004★ 2 cited
Local chromatic number, Ky Fan's theorem, and circular colorings
Gabor Simonyi, Gabor Tardos
The local chromatic number of a graph was introduced by Erdos et al. in 1986. It is in between the chromatic and fractional chromatic numbers. This motivates the study of the local…