Coloring Intersection Graphs of Arc-Connected Sets in the Plane

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.


Published in:
Discrete & Computational Geometry, 52, 2, 399-415
Year:
2014
Publisher:
New York, Springer
ISSN:
0179-5376
Keywords:
Laboratories:




 Record created 2014-10-23, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)