1 paper
Bálint Hujter, Sándor Kisfaludi-Bak
We investigate the question of finding a bound for the size of a χ-colorable finite visibility graph that has at most ℓ collinear points. This can be regarded as a relaxed v…