# Coloring Intersection Graphs of Arc-Connected Sets in the Plane

Discrete & Computational Geometry, Sep 2014

A 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.

This is a preview of a remote PDF: http://link.springer.com/content/pdf/10.1007%2Fs00454-014-9614-5.pdf

Michał Lasoń, Piotr Micek, Arkadiusz Pawlik, Bartosz Walczak. Coloring Intersection Graphs of Arc-Connected Sets in the Plane, Discrete & Computational Geometry, 2014, 399-415, DOI: 10.1007/s00454-014-9614-5