Outerstring graphs are χ-bounded

Alexandre Rok, Bartosz Walczak

Research output: Contribution to journalArticlepeer-review

7 Scopus citations


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 χ-bounded, which means that their chromatic number is bounded by a function of their clique number. This generalizes a series of previous results on χ-boundedness of outerstring graphs with various additional restrictions on the shape of curves or the number of times the pairs of curves can cross. The assumption that each curve has an endpoint on the boundary of the half-plane is justified by the known fact that triangle-free intersection graphs of straight-line segments can have arbitrarily large chromatic number.

Original languageEnglish
Pages (from-to)2181-2199
Number of pages19
JournalSIAM Journal on Discrete Mathematics
Issue number4
StatePublished - 1 Jan 2019


  • Chromatic number
  • Geometric intersection graphs
  • String graphs
  • χ-boundedness

ASJC Scopus subject areas

  • Mathematics (all)


Dive into the research topics of 'Outerstring graphs are χ-bounded'. Together they form a unique fingerprint.

Cite this