Lason, MichalMicek, PiotrPawlik, ArkadiuszWalczak, Bartosz2014-10-232014-10-232014-10-23201410.1007/s00454-014-9614-5https://infoscience.epfl.ch/handle/20.500.14299/107690WOS:000341913500011A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line L if the intersection of any member with L is a nonempty segment. It is proved that the intersection graphs of simple families of compact arc-connected sets in the plane pierced by a common line have chromatic number bounded by a function of their clique number.Geometric intersection graphsChromatic numberchi-boundednesstext::journal::journal article::research article