@inproceedings{504999936c9145e69d0fcaefe83571c3,

title = "Outerstring graphs are Χ-bounded",

abstract = "An outerstring graph is an intersection graph of curves lying in a halfplane with one endpoint on the boundary of the halfplane. It is proved that the outerstring graphs are Χ-bounded, that is, 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 restrictions of the shape of the curves or the number of times the pairs of curves can intersect. This also implies that the intersection graphs of x-monotone curves with bounded clique number have chromatic number O(log n), improving the previous polylogarithmic upper bound. The assumption that each curve has an endpoint on the boundary of the halfplane is justified by the known fact that triangle-free intersection graphs of straight-line segments can have arbitrarily large chromatic number. Copyright is held by the owner/author(s).",

keywords = "Chromatic number, Geometric intersection graphs, Outerstring graphs, Χ-boundedness",

author = "Alexandre Rok and Bartosz Walczak",

year = "2014",

month = jan,

day = "1",

doi = "10.1145/2582112.2582115",

language = "English",

isbn = "9781450325943",

series = "Proceedings of the Annual Symposium on Computational Geometry",

publisher = "Association for Computing Machinery",

pages = "136--143",

booktitle = "Proceedings of the 30th Annual Symposium on Computational Geometry, SoCG 2014",

note = "30th Annual Symposium on Computational Geometry, SoCG 2014 ; Conference date: 08-06-2014 Through 11-06-2014",

}