Outerstring Graphs are $\chi$-Bounded
Outerstring Graphs are $\chi$-Bounded
An outerstring graph is an intersection graph of curves that lie in a common half-plane and have one endpoint on the boundary of that half-plane. We prove that the class of outerstring graphs is $\chi$-bounded, which means that their chromatic number is bounded by a function of their clique number. …