2000 character limit reached
Coloring intersection graphs of x-monotone curves in the plane
Published 4 Jan 2012 in math.CO and cs.CG | (1201.0887v2)
Abstract: A class of graphs G is chi-bounded if the chromatic number of the graphs in G is bounded by some function of their clique number. We show that the class of intersection graphs of simple x-monotone curves in the plane intersecting a vertical line is chi-bounded. As a corollary we show that the class of intersection graphs of rays in the plane is chi-bounded, and the class of intersection graphs of unit segments in the plane is chi-bounded
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.